Randomly encoding functions: A new cryptographic paradigm(Invited Talk)

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

Volumn 6673 LNCS, Issue , 2011, Pages 25-31

  Applebaum, Benny ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC APPLICATIONS; ENCODING FUNCTIONS; INVITED TALK; OUTPUT DISTRIBUTION; RANDOMIZED MAPPING;

CRYPTOGRAPHY; INFORMATION THEORY; SECURITY OF DATA; ENCODING (SYMBOLS);

ENCODING (SYMBOLS); SIGNAL ENCODING;

EID: 79956298358     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20728-0_3     Document Type: Conference Paper

References (24)

1. Applebaum, B.: Key-dependent message security: Generic amplification and completeness. In: Paterson, K. G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 527-546. Springer, Heidelberg (2011)
2. 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)
3. Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Journal of Computional Complexity 15(2), 115-162 (2006) (Pubitemid 43938398)
4. 0. SIAM Journal on Computing 36(4), 845-888 (2006) (Pubitemid 47246873)
5. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography by cellular automata or how fast can complexity emerge in nature? In: ICS 2010(2010)
6. Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: Efficient verification via secure computation. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P. G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 152-163. Springer, Heidelberg (2010); draft of full version available at the authors home page
7. Barak, B., Haitner, I., Hofheinz, D., Ishai, Y.: Bounded key-dependent message security. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 423-444. Springer, Heidelberg (2010)
8. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: STOC 1990(1990)
9. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: STOC 1988(1988)
10. 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)
11. 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)
12. Brakerski, Z., Goldwasser, S.: Circular and leakage resilient public-key encryption under subgroup indistinguishability (or: Quadratic residuosity strikes back). In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 1-20. Springer, Heidelberg (2010)
13. Brakerski, Z., Goldwasser, S., Kalai, Y.: Black-Box Circular-secure encryption beyond affine functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 201-218. Springer, Heidelberg (2011)
14. Camenisch, J. L., 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)
15. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC 1988(1988)
16. Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient multi-party computation over rings. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 596-613. Springer, Heidelberg (2003)
17. Damgård, I. B., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 501-520. Springer, Heidelberg (2006) (Pubitemid 44532135)
18. Dvir, Z., Gutfreund, D., Rothblum, G., Vadhan, S.: On Approximating the Entropy of Polynomial Mappings. In: ICS 2011(2011)
19. Feige, U., Killian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: STOC 1994(1994)
20. Goldwasser, S., Gutfreund, D., Healy, A., Kaufman, T., Rothblum, G. N.: A (de) constructive approach to program checking. In: STOC 2008(2008)
21. Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: FOCS 2000(2000)
22. Ishai, Y., Kushilevitz, E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, p. 244. Springer, Heidelberg (2002)
23. Kilian, J.: Founding cryptography on oblivious transfer. In: STOC 1988(1988)
24. Yao, A. C. C.: Theory and application of trapdoor functions. In: FOCS 1982(1982)