Sciweavers

370 search results - page 43 / 74
» Limits of Constructive Security Proofs
Sort
View
CCS
2001
ACM
13 years 11 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
CCS
2009
ACM
14 years 8 months ago
Conditional proxy re-encryption secure against chosen-ciphertext attack
In a proxy re-encryption (PRE) scheme [4], a proxy, authorized by Alice, transforms messages encrypted under Alice's public key into encryptions under Bob's public key w...
Jian Weng, Robert H. Deng, Xuhua Ding, Cheng-Kang ...
ACNS
2010
Springer
172views Cryptology» more  ACNS 2010»
13 years 11 months ago
Secure Sketch for Multiple Secrets
Secure sketches are useful in extending cryptographic schemes to biometric data since they allow recovery of fuzzy secrets under inevitable noise. In practice, secrets derived from...
Chengfang Fang, Qiming Li, Ee-Chien Chang
ESORICS
2008
Springer
13 years 10 months ago
Improved Security Notions and Protocols for Non-transferable Identification
Abstract. Different security notions and settings for identification protocols have been proposed so far, considering different powerful adversaries that can play "man-in-the-...
Carlo Blundo, Giuseppe Persiano, Ahmad-Reza Sadegh...
SCN
2010
Springer
176views Communications» more  SCN 2010»
13 years 6 months ago
The Fiat-Shamir Transform for Group and Ring Signature Schemes
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi