a590003

[Gro04]
[Gro10]
J. Groth. Rerandomizable and replayable adaptive chosen ciphertext attack secure
cryptosystems. In Proceedings of the 1st Theory of Cryptography Conference, pages
152–170, 2004.
J. Groth. Short pairing-based non-interactive zero-knowledge arguments. In Advances
in Cryptology – ASIACRYPT ’10, pages 321–340, 2010.
[GW11] 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.
[Lin06]
Y. Lindell. A simpler construction of CCA2-secure public-key encryption under general
assumptions. Journal of Cryptology, 19(3):359–377, 2006.
[Lip11] H. Lipmaa. Progression-free sets and sublinear pairing-based non-interactive zeroknowledge
arguments. Cryptology ePrint Archive, Report 2011/009, 2011.
[Mic00] S. Micali. Computationally sound proofs. SIAM Journal of Computing, 30(4):1253–
1298, 2000. An extended abstract appeared in Proceedings of the 35th Annual IEEE
Symposium on Foundations of Computer Science, 1994.
[Nao03] M. Naor. On cryptographic assumptions and challenges. In Advances in Cryptology –
CRYPTO ’03, pages 96–109, 2003.
[NY90]
[PR07]
[PR08]
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.
M. Prabhakaran and M. Rosulek. Rerandomizable RCCA encryption. In Advances in
Cryptology – CRYPTO ’07, pages 517–534, 2007.
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.
[PSV07] R. Pass, A. Shelat, and V. Vaikuntanathan. Relations among notions of nonmalleability
for encryption. In Advances in Cryptology - ASIACRYPT ’07, pages
519–535, 2007.
[RAD78]
R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphisms.
Foundations of Secure Computation, 1978.
[Sah99] A. Sahai. Non-malleable non-interactive zero knowledge and adaptive chosenciphertext
security. In Proceedings of the 40th Annual IEEE Symposium on Foundations
of Computer Science, pages 543–553, 1999.
[SV10]
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.
[Val08] 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.
27
3. Targeted Malleability