Sciweavers

CRYPTO
2004
Springer
205views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
CRYPTO
2004
Springer
138views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Secure Identity Based Encryption Without Random Oracles
We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model. Selective identity secure IBE is a slightly w...
Dan Boneh, Xavier Boyen
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
Masayuki Abe, Serge Fehr
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
CRYPTO
2004
Springer
130views Cryptology» more  CRYPTO 2004»
13 years 11 months 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
Cryptology
Top of PageReset Settings