162
click to vote
EUROCRYPT
2000
Springer
15 years 8 months ago
2000
Springer
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n....
155
click to vote
CRYPTO
2003
Springer
15 years 10 months ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
149
click to vote
PKC
2005
Springer
15 years 10 months ago
2005
Springer
We answer the open question of the possibility of building a digital signature scheme with proven security based on the one-wayness of a trapdoor permutation and with signatures as...