On the role definitions in and beyond cryptography

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

Volumn 3321, Issue , 2004, Pages 13-32

  Rogaway, Phillip ^a,b  

^a University of California   (United States)

^b CHIANG MAI UNIVERSITY   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION MAKING;

ART AND SCIENCE;

CRYPTOGRAPHY;

EID: 35048852068     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30502-6_2     Document Type: Article

References (47)

1. L. Blum, M. Blum, and M. Shub. A simple secure unpredictable unpredictable pseudo-random number generator. SIAM J. on Computing, vol. 15, pp. 364-383, 1986.
2. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. JCSS, vol. 37, no. 2, pp. 156-189, 1988.
3. M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. Crypto '96, LNCS vol. 1109, Springer, 1996.
4. M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A concrete security treatment of symmetric encryption: analysis of the DES modes of operation. FOCS 1997, 1997.
5. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. Crypto '98, LNCS vol. 1462, Springer, 1998.
6. D. Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating faulty minority. J. of Cryptology, vol. 4, no. 2, pp. 75-122, 1991.
7. M. Bellare. Practice-oriented provable security. Lectures on Data Security 1998, LNCS vol. 1561, pp. 1-15, 1999.
8. M. Ben-or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. STOC 1988, ACM Press, pp. 1-10, 1988.
9. M. Bellare, J. Kilian, and P. Rogaway. The security of the cipher block chaining message authentication code. JCSS, vol. 61, no. 3, pp. 262-399, 2000.
10. M. Blum. Coin flipping by phone. IEEE Spring COMPCOM, pp. 133-137, 1982.
11. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. on Computing, vol. 13, no. 4, pp. 850-864, 1984.
12. Earlier version in FOCS 1982.
13. M. Bellare and C. Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. Asiacrypt '00, LNCS vol. 1976, Springer, pp. 531-545, 2000.
14. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. Advances in Cryptology - Eurocrypt '00. LNCS vol. 1807, Springer, 2000.
15. M. Backes, B. Pfitzmann, and M. Waidner. Secure asynchronous reactive systems. Cryptology ePrint report 2004/082, 2004. Earlier version by Pfitzmann and Waidner in IEEE Symposium on Security and Privacy, 2001.
16. M. Backes, B. Pfitzmann, and M. Waidner. A universally composable cryptographic library. Cryptology ePrint report 2003/015, 2003.
17. M. Bellare and P. Rogaway. Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient encryption. Asiacrypt '00, LNCS vol. 1976, Springer, pp. 317-330, 2000.
18. M. Bellare and P. Rogaway. Entity authentication and key distribution. Crypto '93. LNCS vol. 773, pp. 232-249, Springer, 1994.
19. M. Bellare and P. Rogaway. Provably secure session key distribution: the three party case. STOC 1995, pp. 57-66, 1995.
20. M. Bellare and P. Rogaway. Random oracle are practical: a paradigm for designing efficient protocols. Conference on Computer and Communications Security, CCS '93, pp. 62-73, 1993.
21. J. Benaloh and D. Tuinstra. Receipt-free secret ballot elections. STOC 1994, pp. 544-553, 1994.
22. R. Canetti. Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint report 2000/67, 2001. Earlier version in FOCS 2001.
23. K. Choo, C. Boyd, Y. Hitchcock, and G. Maitland. On session identifiers in provably secure protocols, the Bellare-Rogaway three-party key distribution protocol revisited. Security in Communication Networks '04, LNCS, Springer, 2004.
24. R. Canetti, O. Goldreich, and H. Krawczyk. The random oracle methodology, revisited. STOC 1998, pp. 209-218, 1998.
25. R. Canetti and H. Krawczyk. Universally composable notions of key exchange and secure channels. Eurocrypt '02, LNCS vol. 2332, pp. 337-351, Springer, 2002.
26. S. Cook. The complexity of theorem-proving procedures. STOC 1971, ACM Press, pp. 151-158, 1971.
27. P. Donescu, V. Gligor, and D. Wagner. A note on NSA's Dual Counter Mode of encryption. Manuscript, 2001. Available from Wagner's webpage.
28. W. Diffie and M. Hellman. New directions in cryptography. IEEE Trans. on Inf. Th., vol. 22, pp. 644-654, 1976.
29. D. Dolev and A. Yao. On the security of public key protocols. IEEE Trans. on Information Theory, vol. 29, no. 12, pp. 198-208, 1983.
30. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. Crypto '86, LNCS vol. 263, pp. 186-194, Springer, 1986.
31. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions, JACM, vol. 33, no. 4, 210-217, 1986.
32. S. Goldwasser and S. Micali. Probabilistic encryption. JCSS, vol. 28, pp. 270-299, 1984.
33. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. on Computing, vol. 18, no. 1, pp. 186-208, 1989.
34. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. on Computing, vol. 17, no. 2, pp. 281-308, 1988.
35. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game, or a completeness theorem for protocols with honest majority. STOC 1987, pp. 218-229, 1997.
36. O. Goldreich. The foundations of modern cryptography. Manuscript, 2000. Available from Goldreich's webpage. Earlier version in Crypto 97.
37. O. Goldreich. The Foundations of Cryptography. Cambridge University Press. Volume 1 (2001) and Volume 2 (2004).
38. C. JUTLA. Encryption modes with almost free message integrity. Eurocrypt '01, LNCS vol. 2045, Springer, pp. 529-544, 2001.
39. J. Katz and M. Yung. Unforgeable encryption and adaptively secure modes of operation. Fast Software Encryption, FSE 2000. LNCS vol. 1978, Springer, pp. 284-299, 2000.
40. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. on Computing, vol. 17, no. 2, April 1988.
41. S. Micali and L. Reyzin. Physically observable cryptography. TCC 2004, LNCS vol. 2951, Springer, pp. 278-296, 2004. Cryptology ePrint report 2003/120.
42. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. STOC 1989, pp. 33-43, 1989.
43. P. ROGAWAY, M. BELLARE, and J. BLACK. OCB: a block-cipher mode of operation for efficient authenticated encryption. ACM Transactions on Information and System Security (TISSEC), vol. 6, no. 3, pp. 365-403, 2003.
44. C. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, vol. 28, pp. 656-715, 1949.
45. V. Shoup. On formal methods for secure key exchange. Cryptology ePrint report 1999/012, 1999.
46. A. Shamir, R. Rivest, and L. Adleman. Mental poker. MIT/LCS report TM-125, 1979.
47. A. Yao. Theory and applications of trapdoor functions. FOCS 1982, pp. 80-91, 1982.