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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bringer, J., Chabanne, H.: Another Look at Extended Private Information Retrieval Protocols. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 305–322. Springer, Heidelberg (2009)
Babai, L., Pudlák, P., Rödl, V., Szemerédi, E.: Lower Bounds to the Complexity of Symmetric Boolean Functions. Theoretical Computer Science 74(3), 313–323 (1990)
Chmielewski, Ł., Hoepman, J.-H.: Fuzzy Private Matching. In: The Third International Conference on Availability, Reliability and Security, ARES 2008, Barcelona, Spain, March 4-7, pp. 327–334. IEEE Computer Society Press, Los Alamitos (2008)
Canetti, R., Ishai, Y., Kumar, R., Reiter, M.K., Rubinfeld, R., Wright, R.N.: Selective Private Function Evaluation with Applications to Private Statistics. In: PODC 2001, Newport, Rhode Island, USA, August 26-29, pp. 293–304. ACM Press, New York (2001)
Damgård, I., Jurik, M.: A Generalisation, A Simplification And Some Applications of Paillier’s Probabilistic Public-Key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119–136. Springer, Heidelberg (2001)
Gentry, C., Ramzan, Z.: Single-Database Private Information Retrieval with Constant Communication Rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803–815. Springer, Heidelberg (2005)
Ishai, Y., Paskin, A.: Evaluating Branching Programs on Encrypted Data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 575–594. Springer, Heidelberg (2007)
Indyk, P., Woodruff, D.P.: Polylogarithmic Private Approximations and Efficient Matching. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 245–264. Springer, Heidelberg (2006)
Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Communication. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314–328. Springer, Heidelberg (2005)
Lipmaa, H.: How to Disassemble CPIR: First CPIR with Database-Dependent Computation. In: ICISC 2009, Seoul, Korea, December 2-4. LNCS. Springer, Heidelberg (2009)
Laur, S., Lipmaa, H.: A New Protocol for Conditional Disclosure of Secrets And Its Applications. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 207–225. Springer, Heidelberg (2007)
Sinha, R.K., Thathachar, J.S.: Efficient Oblivious Branching Programs for Threshold And Mod Functions. Journal of Computer and System Sciences 55(3), 373–384 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lipmaa, H., Zhang, B. (2010). Efficient Generalized Selective Private Function Evaluation with Applications in Biometric Authentication. In: Bao, F., Yung, M., Lin, D., Jing, J. (eds) Information Security and Cryptology. Inscrypt 2009. Lecture Notes in Computer Science, vol 6151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16342-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-16342-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16341-8
Online ISBN: 978-3-642-16342-5
eBook Packages: Computer ScienceComputer Science (R0)