Sciweavers

44 search results - page 4 / 9
» A Multi-trapdoor Commitment Scheme from the RSA Assumption
Sort
View
CRYPTO
2004
Springer
130views Cryptology» more  CRYPTO 2004»
14 years 11 days ago
Signature Schemes and Anonymous Credentials from Bilinear Maps
Abstract. We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption p...
Jan Camenisch, Anna Lysyanskaya
IACR
2011
134views more  IACR 2011»
12 years 6 months ago
Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
Dario Catalano, Dario Fiore
EUROCRYPT
2009
Springer
14 years 7 months ago
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
The existence of encryption and commitment schemes secure under selective opening attack (SOA) has remained open despite considerable interest and attention. We provide the rst pub...
Mihir Bellare, Dennis Hofheinz, Scott Yilek
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
11 years 9 months ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman
CRYPTO
2001
Springer
153views Cryptology» more  CRYPTO 2001»
13 years 11 months ago
Universally Composable Commitments
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
Ran Canetti, Marc Fischlin