6 search results - page 1 / 2 » Composition Implies Adaptive Security in Minicrypt |
EUROCRYPT
2006
Springer
13 years 8 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...
EUROCRYPT
2004
Springer
13 years 10 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...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
STOC
2006
ACM
13 years 10 months ago
2006
ACM
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these ...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...