Sciweavers

112 search results - page 17 / 23
» Security proofs for an efficient password-based key exchange
Sort
View
EUROCRYPT
2010
Springer
13 years 10 months ago
Efficient Lattice (H)IBE in the Standard Model
We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in...
Shweta Agrawal, Dan Boneh, Xavier Boyen
CCS
2008
ACM
13 years 9 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
FC
2008
Springer
134views Cryptology» more  FC 2008»
13 years 9 months ago
Generalized Non-Interactive Oblivious Transfer Using Count-Limited Objects with Applications to Secure Mobile Agents
Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evaluation (SFE) protocols. However, interaction is a pri...
Vandana Gunupudi, Stephen R. Tate
EUROCRYPT
2000
Springer
13 years 11 months ago
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
Ivan Damgård
20
Voted
CRYPTO
2007
Springer
105views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...
Emmanuel Bresson, Yassine Lakhnech, Laurent Mazar&...