27 search results - page 1 / 6 » Adaptively Secure Puncturable Pseudorandom Functions in the ... |
IACR
2011
12 years 4 months ago
2011
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
ACNS
2010
Springer
13 years 9 months ago
2010
Springer
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
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...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Within the security architecture of the 3GPP system there is a standardised encryption mode f8 based on the block cipher KASUMI. In this work we examine the pseudorandomness of the...
FOCS
2010
IEEE
13 years 2 months ago
2010
IEEE
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...