Rerandomizable RCCA encryption

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

Volumn 4622 LNCS, Issue , 2007, Pages 517-534

  Prabhakaran, Manoj ^a   Rosulek, Mike ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING; SECURITY OF DATA;

CRAMER-SHOUP ENCRYPTION; ENCRYPTION SCHEME;

CRYPTOGRAPHY;

EID: 38049182742     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74143-5_29     Document Type: Conference Paper

References (26)

1. An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 83-107. Springer, Heidelberg (2002)
2. Andersen, J.K., Weisstein, E.W.: Cunningham chain. From MathWorld-A Wolfram Web Resource (2005), http://mathworld.wolfram.com/CunninghamChain.html
3. Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 566-582. Springer, Heidelberg (2001)
4. Boneh, D.: The decision diffie-hellman problem. In: Buhler, J.P. (ed.) Algorithmic Number Theory. LNCS, vol. 1423, pp. 48-63. Springer, Heidelberg (1998)
5. Camenisch, J., Lysyanskaya, A.: A formal treatment of onion routing. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 169-187. Springer, Heidelberg (2005)
6. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067 (2005)
7. Canetti, R., Krawczyk, H., Nielsen, J.B.: Relaxing chosen-ciphertext security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 565-582. Springer, Heidelberg (2003)
8. Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 4(2) (February 1981)
9. Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462. Springer, Heidelberg (1998)
10. Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45-64. Springer, Heidelberg (2002)
11. Danezis, G.: Breaking four mix-related schemes based on universal re-encryption. In: Proceedings of Information Security Conference 2006. Springer, Heidelberg (2006)
12. Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: The second-generation onion router. In: USENIX Security Symposium, pp. 303-320. USENIX (2004)
13. Elkind, E., Sahai, A.: A unified methodology for constructing public-key encryption schemes secure against adaptive chosen-ciphertext attack. Cryptology ePrint Archive, Report 2002/042 (2002), http://eprint.iacr.org/
14. Gamal, T.E.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, CR., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10-18. Springer, Heidelberg (1985)
15. Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press, Cambridge (2004)
16. Goldschlag, D.M., Reed, M.C., Syverson, P.F.: Onion routing. Commun. ACM 42(2), 39-41 (1999)
17. Golle, P., Jakobsson, M., Juels, A., Syverson, P.: Universal re-encryption for mixnets. In: Proceedings of the 2004 RSA Conference, Cryptographer's track, San Francisco, USA (February 2004)
18. Gröth, J.: Rerandomizable and replayable adaptive chosen ciphertext attack secure cryptosystems. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 152-170. Springer, Heidelberg (2004)
19. Klonowski, M., Kutylowski, M., Lauks, A., Zagórski, F.: Universal re-encryption of signatures and controlling anonymous information flow. In: WARTACRYPT '04 Conference on Cryptology. Bedlewo/Poznan (2006)
20. Lad, M.: Personal communication (2005)
21. The onion routing program. A program sponsored by the Office of Naval Research, DARPA and the Naval Research Laboratory, http://www.onion-router.net/
22. Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: ACM Conference on Computer and Communications Security, pp. 245-254. ACM Press, New York (2000)
23. Prabhakaran, M.: New Notions of Security. PhD thesis, Department of Computer Science, Princeton University (2005)
24. Prabhakaran, M., Rosulek, M.: Anonymous rerandomizable rcca encryption. Cryptology ePrint Archive, Report 2007/119, (2007), http://eprint.iacr.org/
25. Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: STOC, pp. 242-251. ACM Press, New York (2004)
26. Shoup, V.: A proposal for an iso standard for public key encryption. Cryptology ePrint Archive, Report 2001/112, (2001), http://eprint.iacr.org/