Efficient generalized selective private function evaluation with applications in biometric authentication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6151 LNCS, Issue , 2010, Pages 154-163

  Lipmaa, Helger ^a,b   Zhang, Bingsheng ^a,c  

^a CYBERNETICA AS   (Estonia)

^b TALLINN UNIVERSITY   (Estonia)

^c UNIVERSITY OF TARTU   (Estonia)

Author keywords

BDD; biometric authentication; CPIR; cryptocomputing; selective private function evaluation

Indexed keywords

BDD; BIOMETRIC AUTHENTICATION; CPIR; CRYPTOCOMPUTING; SELECTIVE PRIVATE FUNCTION EVALUATION;

AUTHENTICATION; BIOMETRICS; CRYPTOGRAPHY; FUNCTION EVALUATION;

SECURITY OF DATA;

EID: 78650181766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16342-5_12     Document Type: Conference Paper

References (12)

1. 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)
2. 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)
3. 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)
4. 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)
5. 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)
6. 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)
7. 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)
8. 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)
9. 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)
10. Lipmaa, H.: How to Disassemble CPIR: First CPIR with Database-Dependent Computation. In: ICISC 2009, Seoul, Korea, December 2-4. LNCS. Springer, Heidelberg (2009)
11. 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)
12. 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)