33 search results - page 7 / 7 » stoc 2000 |
ASIACRYPT
2011
Springer
12 years 5 months ago
2011
Springer
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
CRYPTO
2011
Springer
12 years 5 months ago
2011
Springer
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...