Bounded key-dependent message security

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

Volumn 6110 LNCS, Issue , 2010, Pages 423-444

  Barak, Boaz ^a   Haitner, Iftach ^b   Hofheinz, Dennis ^c   Ishai, Yuval ^d,e  

^a PRINCETON UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

formal security; fully homomorphic encryption; KDM clique circular security

Indexed keywords

BLACK BOXES; CIRCUIT SIZE; FORMAL SECURITY; FULLY HOMOMORPHIC ENCRYPTION; IMPOSSIBILITY RESULTS; PSEUDO-RANDOM FUNCTIONS; PUBLIC KEYS; PUBLIC-KEY ENCRYPTION SCHEME; SECRET KEY; STANDARD ASSUMPTIONS; THE STANDARD MODEL;

IMAGE QUALITY; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; STANDARDS;

NETWORK SECURITY;

EID: 77954643565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13190-5_22     Document Type: Conference Paper

References (29)

1. Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology 15(2), 103-127 (2002)
2. Adão, P., Bana, G., Herzog, J., Scedrov, A.: Soundness of formal encryption in the presence of key-cycles. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 374-396. Springer, Heidelberg (2005)
3. Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595-618. Springer, Heidelberg (2009)
4. Backes, M., Pfitzmann, B., Waidner, M.: A composable cryptographic library with nested operations (extended abstract). In: ACM CCS 2003, pp. 220-230 (2003);
5. Full version in IACR Cryptology ePrint Archive 2003/015 (January 2003), http://eprint.iacr.org/
6. Barak, B., Haitner, I., Hofheinz, D., Ishai, Y.: Bounded key-dependent message security. Cryptology ePrint Archive, Report 2009/511 (2009), http://eprint.iacr.org/
7. Black, J., Rogaway, P., Shrimpton, T.: Encryption-scheme security in the presence of key-dependent messages. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 62-75. Springer, Heidelberg (2003)
8. Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-secure encryption from decision diffie-hellman. In:Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 108-125. Springer, Heidelberg (2008)
9. Brakerski, Z., Goldwasser, S., Kalai, Y.: Circular-secure encryption beyond affine functions. Cryptology ePrint Archive, Report 2009/485 (2009), http://eprint.iacr.org/
10. Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 93. Springer, Heidelberg (2001)
11. Crépeau, C., Kilian, J.: Weakening security assumptions and oblivious transfer. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 2-7. Springer, Heidelberg (1990)
12. Damgård, I., Jurik, M.J.: A generalisation, a simplification and some applications of paillier's probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992. Springer, Heidelberg (2001) (Pubitemid 33232937)
13. Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Transactions on Information Theory 29(2), 198-208 (1983)
14. Even, S., Goldreich, O.: On the security of multi-party ping-pong protocols. In: FOCS 1983 (1983)
15. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM (1985)
16. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC (2009)
17. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC (1989)
18. Haitner, I., Holenstein, T.: On the (im)possibility of key dependent encryption. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 202-219. Springer, Heidelberg (2009)
19. Halevi, S., Krawczyk, H.: Security under key-dependent inputs. In: ACM CCS 2007 (2007)
20. Hofheinz, D., Unruh, D.: Towards key-dependent message security in the standard model. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 108-126. Springer, Heidelberg (2008) (Pubitemid 351762826)
21. 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)
22. Kemmerer, R., Meadows, C., Millen, J.: Three systems for cryptographic protocol analysis. Journal of Cryptology 7(2), 79-130 (1994)
23. Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055. Springer, Heidelberg (1996)
24. Merritt, M.: Cryptographic Protocols. PhD thesis, Georgia Institute of Technology (1983)
25. Micciancio, D., Warinschi, B.: Soundness of formal encryption in the presence of active adversaries. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 133-151. Springer, Heidelberg (2004) (Pubitemid 38236623)
26. Naor, M.: On cryptographic assumptions and challenges. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 96-109. Springer, Heidelberg (2003)
27. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 223. Springer, Heidelberg (1999)
28. Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)
29. Yao, A.C.: How to generate and exchange secrets. In: FOCS 1986 (1986)