Reconciling non-malleability with homomorphic encryption

DOI10.1007/s00145-016-9231-yzbMath1377.94062OpenAlexW2343630731WikidataQ122584007 ScholiaQ122584007MaRDI QIDQ2408582

Manoj Prabhakaran, Mike Rosulek

Publication date: 12 October 2017

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-016-9231-y

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Advances in cryptology -- CRYPTO 2003. 23rd annual international cryptology conference, Santa Barbara, California, USA, August 17--21, 2003. Proceedings
• Advances in cryptology - EUROCRYPT 2002. 21st international conference on the theory and applications of cryptographic techniques, Amsterdam, the Netherlands, April 28 -- May 2, 2002. Proceedings
• Theory of cryptography. First theory of cryptography conference, TCC 2004, Cambridge, MA, USA, February 19--21, 2004. Proceedings.
• Theory of cryptography. 4th theory of cryptography conference, TCC 2007, Amsterdam, The Netherlands, February 21--24, 2007. Proceedings.
• Theory of cryptography. Second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005. Proceedings.
• Advances in cryptology -- ASIACRYPT 2007. 13th international conference on the theory and application of cryptology and information security, Kuching, Malaysia, December 2-6, 2007. Proceedings
• Theory of cryptography. Third theory of cryptography conference, TCC 2006, New York, NY, USA, March 4--7, 2006. Proceedings.
• Receipt-free secret-ballot elections (extended abstract)
• Targeted malleability
• Multi-Authority Secret-Ballot Elections with Linear Work
• Computing on Authenticated Data
• Malleable Proof Systems and Applications
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Information-Theoretic Security Without an Honest Majority
• Breaking Four Mix-Related Schemes Based on Universal Re-encryption
• Homomorphic Encryption with CCA Security
• Towards a Separation of Semantic and CCA Security for Public Key Encryption
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
• Towards Robust Computation on Encrypted Data
• Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
• Rerandomizable RCCA Encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• Fully homomorphic encryption using ideal lattices
• Advances in Cryptology - EUROCRYPT 2004
• A Non-interactive Shuffle with Pairing Based Verifiability
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Theory of Cryptography
• Verifiable Shuffle of Large Size Ciphertexts
• Theory of Cryptography
• Theory of Cryptography
• Computer Aided Verification
• Topics in Cryptology – CT-RSA 2004
• Theory of Cryptography
• Theory of Cryptography