Sciweavers

91 search results - page 16 / 19
» Lattice-Based Blind Signatures
Sort
View
IEEEARES
2007
IEEE
14 years 4 months ago
A Practical Verifiable e-Voting Protocol for Large Scale Elections over a Network
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, indiv...
Orhan Cetinkaya, Ali Doganaksoy
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
EUROCRYPT
2007
Springer
14 years 4 months ago
Simulatable Adaptive Oblivious Transfer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
Jan Camenisch, Gregory Neven, Abhi Shelat
COMPSAC
2006
IEEE
14 years 4 months ago
Agent-Based Offline Electronic Voting
—Many electronic voting systems, classified mainly as homomorphic cryptography based, mix-net based and blind signature based, appear after the eighties when zero knowledge proof...
Mehmet Tahir Sandikkaya, Bülent Örencik
BROADNETS
2005
IEEE
14 years 4 months ago
Privacy enhanced access control in pervasive computing environments
Abstract— Privacy and security are two important but seemingly contradict objectives in pervasive computing environments (PCEs). On the one hand, service providers want to authen...
Kui Ren, Wenjing Lou