Efficient Generalized Selective Private Function Evaluation with Applications in Biometric Authentication. Abstract. 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. Computing Blindfolded: New Developments in. Searching for phrase branching program (changed automatically) with no syntactic query expansion in all metadata. Evaluating branching programs on encrypted data by Yuval Ishai, Anat Paskin. As interesting special cases, one can efficiently evaluate finite automata, decision trees, and OBDDs on encrypted data. Evaluating Branching Programs on Encrypted Data. Yuval Ishai, Anat Paskin-Cherniavsky; TCC; 2007; A New Protocol for Conditional Disclosure of Secrets and Its Applications. Sven Laur, Helger Lipmaa; ACNS; 2005; Polylogarithmic. Extracted Key Phrases. Evaluating Branching Programs On Encrypted Data StoreEvaluating Branching Programs On Encrypted Data CubeRajesh Krishnan and Ravi Sundaram' Evaluating encrypted Boolean functions on encrypted.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
December 2016
Categories |