Plaintext awareness via key registration

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

Volumn 2729, Issue , 2003, Pages 548-564

  Herzog, Jonathan ^a   Liskov, Moses ^a   Micali, Silvio ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CHOSEN CIPHERTEXT ATTACK; DOLEV-YAO MODEL; PLAINTEXT; PLAINTEXT AWARENESS; REAL-WORLD; THIRD PARTIES; WITHOUT RANDOM ORACLES;

CRYPTOGRAPHY;

EID: 35248848005     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_32     Document Type: Article

References (20)

1. Bellare, M., Rogaway, P.: Optimal asymmetric encryption- how to encrypt with RSA. In Santis, A.D., ed.: Advances in Cryptology - Eurocrypt 94 Proceedings. Volume 950 of Lecture Notes in Computer Science., Springer-Verlag (1995) 92-111
2. Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In Krawczyk, H., ed.: Advances in Cryptology (CRYPTO 98). Volume 1462 of Lecture Notes in Computer Science., Springer-Verlag (1998) 26-45 Full version found at http://www.cs.ucsd.edu/users/mihir/papers/relations.html.
3. Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Advances in Cryptology - CRYPTO 1998. Number 1462 in LNCS, Springer-Verlag (1998) 13-25
4. Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: Proceedings of 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS). (1999) 543-553
5. Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: 22nd Annual ACM Symposium on Theory of Computing. (1990) 427-437
6. Rackoff, C., Simon, D.: Noninteractive zero-knowledge proof of knowledge and the chosen-ciphertext attack. In: Advances in Cryptology- CRYPTO 91. Number 576 in Lecture Notes in Computer Science (1991) 433-444
7. Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Transactions on Information Theory 29 (1983) 198-208
8. Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Margaria, Steffen, eds.: Tools and Algorithms for the Construction and Analysis of Systems. Volume 1055 of Lecture Notes in Computer Science. Springer-Verlag (1996) 147-166
9. Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Journal of Computer Security 6 (1998) 85-128
10. Song, D.: Athena, an automatic checker for security protocol analysis. In: Proceedings of the 12th IEEE Computer Security Foundations Workshop. (1999) 192-202
11. Goldwasser, S., Micali, S., Rackoff, C.: The knowedge complexity of interactive proof systems. In: Proceedings of the 17th ACM Symposium on Theory of Computing. (1985) 291-304 Superseded by journal version.
12. Blum, M., Feldman, P., Micali, S.:. Non-interactive zero knowledge proof systems and applications. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing. (1988) 103-112
13. Santis, A.D., Micali, S., Persiano, G.: Non-interactive zero-knowledge proof systems. In Pomerance, C., ed.: Proceedings Crypto '87, Springer-Verlag (1988) 52-72 Lecture Notes in Computer Science No. 293.
14. Blum, M., Santis, A.D., Micali, S., Persiano, G.: Noninteractive zero knowledge. SIAM Journal on Computing 20 (1991) 1084-1118
15. Boyar, J., Damgård, I., Peralta, R.: Short non-interactive cryptographic proofs. Journal of Cryptology: the journal of the International Association for Cryptologic Research 13 (2000) 449-472
16. Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences (1984) 270-299
17. Bellare, M., Goldreich, O.: On defining proofs of knowledge. In Brickell, E., ed.: Advances in Cryptology - Crypto 92 Proceedings. Volume 740 of Lecture Notes in Computer Science., Springer-Verlang (1992) 390-420
18. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38 (1991) 691-729
19. Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). In: IFIP International Conference on Theoretical Computer Science (IFIP TCS2000). Number 1872 in Lecture Notes in Computer Science, Springer-Verlag (2000) 3-22
20. Herzog, J.: Computational soundness for formal adversaries. Master's thesis, Massachusetts Institute of Technology (2002)