14 search results - page 1 / 3 » Composition Does Not Imply Adaptive Security |
CRYPTO
2005
Springer
14 years 2 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...
EUROCRYPT
2004
Springer
14 years 1 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...
EUROCRYPT
2006
Springer
14 years 6 days 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...
TCC
2007
Springer
14 years 2 months ago
2007
Springer
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
STOC
2006
ACM
14 years 2 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 ...