a590003

[BS99] 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.
[BSM + 91]
[CGS97]
[CKN03]
[CKV10]
[CS98]
[CT10]
[Dam91]
[DDN00]
[DNR04]
[FLS90]
[Gen09]
M. Blum, A. D. Santis, S. Micali, and G. Persiano. Noninteractive zero-knowledge.
SIAM Journal on Computing, 20(6):1084–1118, 1991.
R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multiauthority
election scheme. In Advances in Cryptology – EUROCRYPT ’97, pages
103–118, 1997.
R. Canetti, H. Krawczyk, and J. B. Nielsen. Relaxing chosen-ciphertext security. In
Advances in Cryptology – CRYPTO ’03, pages 565–582, 2003.
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.
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.
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.
I. Damgård. Towards practical public key systems secure against chosen ciphertext
attacks. In Advances in Cryptology – CRYPTO ’91, pages 445–456, 1991.
D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM Journal on
Computing, 30(2):391–437, 2000.
C. Dwork, M. Naor, and O. Reingold. Immunizing encryption schemes from decryption
errors. In Advances in Cryptology – EUROCRYPT ’04, pages 342–360, 2004.
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.
C. Gentry. A fully homomorphic encryption scheme. PhD Thesis, Stanford University,
2009. Available at http://crypto.stanford.edu/craig.
[GGP10] 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.
[GHV10] 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.
[GKR08]
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.
26
3. Targeted Malleability