17 search results - page 3 / 4 » More Constructions of Lossy and Correlation-Secure Trapdoor ... |
JOC
2007
13 years 5 months ago
2007
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we revisit one of the most popular passwordbased key exchange protocols, namely the OKE (for Open Key Exchange) scheme, proposed by Luck in 1997. Our result...
ACNS
2004
Springer
13 years 10 months ago
2004
Springer
We study the data privacy of cryptosystems with All-or-Nothing transform (AONT). An AONT is an efficient computable transform with two properties: Given all the bits of its output...