JCP
2008
13 years 4 months ago
2008
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
ECCC
2006
13 years 4 months ago
2006
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
ECCC
2010
13 years 4 months ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
We consider two of the most fundamental theorems in Cryptography. The first, due to H
EUROCRYPT
2010
Springer
13 years 9 months ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
FSTTCS
2003
Springer
13 years 9 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
FOCS
2003
IEEE
13 years 9 months ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
ICICS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. One of the central lines of cryptographic research is identifying the weakest assumptions required for the construction of secure primitives. In the context of group sign...
FC
2005
Springer
13 years 10 months ago
2005
Springer
We demonstrate how to make voting protocols resistant against manipulation by computationally bounded malicious voters, by extending the previous results of Conitzer and Sandholm i...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...