Sciweavers

242 search results - page 25 / 49
» Randomness in Cryptography
Sort
View
TCC
2010
Springer
231views Cryptology» more  TCC 2010»
16 years 2 months ago
A Domain Extender for the Ideal Cipher
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
Jean-Sébastien Coron, Yevgeniy Dodis, Avrad...
TCC
2007
Springer
91views Cryptology» more  TCC 2007»
15 years 11 months ago
Lower Bounds for Non-interactive Zero-Knowledge
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
Hoeteck Wee
ACNS
2005
Springer
94views Cryptology» more  ACNS 2005»
15 years 11 months ago
Optimal Asymmetric Encryption and Signature Paddings
Strong security notions often introduce strong constraints on the construction of cryptographic schemes: semantic security implies probabilistic encryption, while the resistance to...
Benoît Chevallier-Mames, Duong Hieu Phan, Da...
EUROCRYPT
2004
Springer
15 years 10 months ago
Black-Box Composition Does Not Imply Adaptive Security
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...
Steven Myers
WCC
2005
Springer
123views Cryptology» more  WCC 2005»
15 years 11 months ago
RSA-Based Secret Handshakes
A secret handshake mechanism allows two entities, members of a same group, to authenticate each other secretly. This primitive was introduced recently by Balfanz, Durfee, Shankar, ...
Damien Vergnaud