Sciweavers

67 search results - page 8 / 14
» crypto 2007
Sort
View
CRYPTO
2007
Springer
109views Cryptology» more  CRYPTO 2007»
15 years 11 months ago
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
Ivan Damgård, Serge Fehr, Renato Renner, Lou...
CRYPTO
2007
Springer
105views Cryptology» more  CRYPTO 2007»
15 years 11 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&...
CTRSA
2007
Springer
102views Cryptology» more  CTRSA 2007»
15 years 9 months ago
Improved Efficiency for Private Stable Matching
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 11 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro
CSFW
2007
IEEE
15 years 11 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet