Lower bounds to the complexity of symmetric Boolean functions
Theoretical Computer Science
Efficient oblivious branching programs for threshold and mod functions
Journal of Computer and System Sciences
Selective private function evaluation with applications to private statistics
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Fuzzy Private Matching (Extended Abstract)
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
A New Protocol for Conditional Disclosure of Secrets and Its Applications
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Another Look at Extended Private Information Retrieval Protocols
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Evaluating branching programs on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
First CPIR protocol with data-dependent computation
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Single-database private information retrieval with constant communication rate
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An oblivious transfer protocol with log-squared communication
ISC'05 Proceedings of the 8th international conference on Information Security
Polylogarithmic private approximations and efficient matching
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.01 |
In a selective private function evaluation (SPFE) protocol, the client privately computes some predefined function on his own input and on m out of server's n database elements. We propose two new generalized SPFE protocols that are based on the new cryptocomputing protocol by Ishai and Paskin and an efficient CPIR. The first protocol works only for constant values of m, but has 2 messages, and is most efficient when m = 1. The second SPFE protocol works for any m, has 4 messages, and is efficient for a large class of functionalities. We then propose an efficient protocol for private similarity test, where one can compute how similar client's input is to a specific element in server's database, without revealing any information to the server. The latter protocol has applications in biometric authentication.