ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > AUTHORS > ENAV WEINREB:
All reports by Author Enav Weinreb:

TR05-141 | 29th November 2005
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb

Private Approximation of Search Problems

Many approximation algorithms have been presented in the last decades
for hard search problems. The focus of this paper is on cryptographic
applications, where it is desired to design algorithms which do not
leak unnecessary information. Specifically, we are interested in
private approximation algorithms -- efficient algorithms ... more >>>




ISSN 1433-8092 | Imprint