Sciweavers

IACR
2011
92views more  IACR 2011»
12 years 6 months ago
From Non-Adaptive to Adaptive Pseudorandom Functions
Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i....
Iftach Haitner, Itay Berman
IACR
2011
90views more  IACR 2011»
12 years 6 months ago
On the Security of the Winternitz One-Time Signature Scheme
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 ...
Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andre...
CCS
2009
ACM
13 years 11 months ago
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
In this paper, we generalize Naor and Reingold's construction of pseudorandom functions under the DDH Assumption to yield a construction of pseudorandom
Allison B. Lewko, Brent Waters
ACNS
2010
Springer
159views Cryptology» more  ACNS 2010»
13 years 11 months ago
A Message Recognition Protocol Based on Standard Assumptions
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...
Atefeh Mashatan, Serge Vaudenay