242 search results - page 25 / 49 » Randomness in Cryptography |
TCC
2010
Springer
15 years 6 months ago
2010
Springer
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...
TCC
2007
Springer
15 years 3 months ago
2007
Springer
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...
77
Voted
ACNS
2005
Springer
15 years 3 months ago
2005
Springer
Strong security notions often introduce strong constraints on the construction of cryptographic schemes: semantic security implies probabilistic encryption, while the resistance to...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
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...
WCC
2005
Springer
15 years 3 months ago
2005
Springer
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, ...