Targeted malleability: Homomorphic encryption for restricted computations

ITCS 2012 - Innovations in Theoretical Computer Science Conference

Volumn , Issue , 2012, Pages 350-366

  Boneh, Dan ^a   Segev, Gil ^b   Waters, Brent ^c  

^a STANFORD UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

homomorphic encryption; non malleable encryption

Indexed keywords

BUILDING BLOCKES; CIPHERTEXTS; ENCRYPTED DATA; HOMOMORPHIC-ENCRYPTIONS; NON-INTERACTIVE; NON-MALLEABILITY; NON-MALLEABLE; NON-TRIVIAL; THE STANDARD MODEL;

COMPUTER SCIENCE; IMAGE QUALITY; INNOVATION;

CRYPTOGRAPHY;

EID: 84856449144     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2090236.2090264     Document Type: Conference Paper

References (38)

1. J. H. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. In Advances in Cryptology - EUROCRYPT '02, pages 83-107, 2002.
2. B. Applebaum, Y. Ishai, and E. Kushilevitz. From secrecy to soundness: Efficient verification via secure computation. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming, pages 152-163, 2010.
3. M. Bellare and A. Palacio. The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In Advances in Cryptology - CRYPTO '04, pages 273-289, 2004.
4. M. Bellare and A. Palacio. Towards plaintext-aware public-key encryption without random oracles. In Advances in Cryptology - ASIACRYPT '04, pages 48-62, 2004.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM Conference on Computer and Communications Security, pages 62-73, 1993.
6. M. Bellare and A. Sahai. Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization. In Advances in Cryptology - CRYPTO '99, pages 519-536, 1999. The full version is available as Cryptology ePrint Archive, Report 2006/228.
7. M. Blum, P. Feldman, and S. Micali. Non-interactive zero-knowledge and its applications. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 103-112, 1988.
8. M. Blum, A. D. Santis, S. Micali, and G. Persiano. Noninteractive zero-knowledge. SIAM Journal on Computing, 20(6):1084-1118, 1991.
9. R. Canetti, H. Krawczyk, and J. B. Nielsen. Relaxing chosen-ciphertext security. In Advances in Cryptology - CRYPTO '03, pages 565-582, 2003.
10. A. Chiesa and E. Tromer. Proof-carrying data and hearsay arguments from signature cards. In Proceedings of the 1st Symposium on Innovations in Computer Science, pages 310-331, 2010.
11. K.-M. Chung, Y. Kalai, and S. Vadhan. Improved delegation of computation using fully homomorphic encryption. In Advances in Cryptology - CRYPTO '10, pages 483-501, 2010.
12. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology - EUROCRYPT '97, pages 103-118, 1997.
13. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology - CRYPTO '98, pages 13-25, 1998.
14. I. Damgård. Towards practical public key systems secure against chosen ciphertext attacks. In Advances in Cryptology - CRYPTO '91, pages 445-456, 1991.
15. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM Journal on Computing, 30(2):391-437, 2000.
16. C. Dwork, M. Naor, and O. Reingold. Immunizing encryption schemes from decryption errors. In Advances in Cryptology - EUROCRYPT '04, pages 342-360, 2004.
17. U. Feige, D. Lapidot, and A. Shamir. Multiple non-interactive zero knowledge proofs based on a single random string. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 308-317, 1990.
18. R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In Advances in Cryptology - CRYPTO '10, pages 465-482, 2010.
19. C. Gentry. A fully homomorphic encryption scheme. PhD Thesis, Stanford University, 2009. Available at http://crypto.stanford.edu/craig.
20. C. Gentry, S. Halevi, and V. Vaikuntanathan. i-hop homomorphic encryption and rerandomizable Yao circuits. In Advances in Cryptology - CRYPTO '10, pages 155-172, 2010.
21. C. Gentry and D. Wichs. Separating succinct non-interactive arguments from all falsifiable assumptions. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pages 99-108, 2011.
22. S. Goldwasser, Y. T. Kalai, and G. Rothblum. Delegating computation: Interactive proofs for muggles. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pages 113-122, 2008.
23. J. Groth. Rerandomizable and replayable adaptive chosen ciphertext attack secure cryptosystems. In Proceedings of the 1st Theory of Cryptography Conference, pages 152-170, 2004.
24. J. Groth. Short pairing-based non-interactive zero-knowledge arguments. In Advances in Cryptology - ASIACRYPT '10, pages 321-340, 2010.
25. Y. Lindell. A simpler construction of CCA2-secure public-key encryption under general assumptions. Journal of Cryptology, 19(3):359-377, 2006.
26. H. Lipmaa. Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. Cryptology ePrint Archive, Report 2011/009, 2011.
27. S. Micali. Computationally sound proofs. SIAM Journal of Computing, 30(4):1253-1298, 2000.
28. An extended abstract appeared in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994.
29. M. Naor. On cryptographic assumptions and challenges. In Advances in Cryptology - CRYPTO '03, pages 96-109, 2003.
30. M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 427-437, 1990.
31. R. Pass, A. Shelat, and V. Vaikuntanathan. Relations among notions of non-malleability for encryption. In Advances in Cryptology - ASIACRYPT '07, pages 519-535, 2007.
32. M. Prabhakaran and M. Rosulek. Rerandomizable RCCA encryption. In Advances in Cryptology - CRYPTO '07, pages 517-534, 2007.
33. M. Prabhakaran and M. Rosulek. Homomorphic encryption with CCA security. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming, pages 667-678, 2008.
34. R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphisms. Foundations of Secure Computation, 1978.
35. A. Sahai. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 543-553, 1999.
36. N. P. Smart and F. Vercauteren. Fully homomorphic encryption with relatively small key and ciphertext sizes. In Public Key Cryptography - PKC '10, pages 420-443, 2010.
37. P. Valiant. Incrementally verifiable computation - or -proofs of knowledge imply time/space efficiency. In Proceedings of the 5th Theory of Cryptography Conference, pages 1-18, 2008.
38. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan. Fully homomorphic encryption over the integers. In Advances in Cryptology - EUROCRYPT '10, pages 24-43, 2010.