151
click to vote
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
134
click to vote
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper studies the gaps that exist between cryptography as studied in theory, as defined in standards, as implemented by software engineers, and as actually consumed ...
107
click to vote
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
The holy grail of a mathematical model of secure encryption is to devise a model that is both faithful in its description of the real world, and yet admits a construction for an en...
127
click to vote
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
The Feistel-network is a popular structure underlying many block-ciphers where the cipher is constructed from many simpler rounds, each defined by some function which is derived fr...
128
click to vote
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Lattice-based signature schemes following the GoldreichGoldwasser-Halevi (GGH) design have the unusual property that each signature leaks information on the signer's...