Cryptographic security of reactive systems: (Extended abstract)

Electronic Notes in Theoretical Computer Science

Volumn 32, Issue , 2000, Pages 59-77

  Pfitzmann, Birgit ^a   Schunter, Matthias ^a   Waidner, Michael ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FORMAL LANGUAGES; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY SYSTEMS; SEMANTICS; SWITCHING; THEOREM PROVING;

ABSTRACTED SECURITY; CRYPTOGRAPHIC SECURITY; CRYPTOGRAPHIC SEMANTICS; REACTIVE SYSTEMS;

SECURITY OF DATA;

EID: 0005076119     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00095-7     Document Type: Conference Paper

References (43)

1. M. Abadi, Protection in Programming-Language Translations, 25th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 1443, Springer-Verlag, Berlin 1998, 8689-883
2. M. Abadi, A. D. Gordon, A Calculus for Cryptographic Protocols: The Spi Calculus, 4th Conference on Computer and Communications Security, ACM, New York 1997, 36-47
3. M. Abadi, M. R. Tuttle, A Semantics for a Logic of Authentication, 10th Symposium on Principles of Distributed Computing (PODC), ACM, New York 1991, 201-216
4. D. Beaver, Secure Multiparty Protocols and Zero Knowledge Proof Systems Tolerating a Faulty Minority, Journal of Cryptology 4/2 (1991)75-122
5. M. Bellare, R. Canetti, H. Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols, 13th Symposium on Theory of Computing (STOC), ACM, New York 1998, 419-428
6. M. Bellare, A. Desai, D. Pointcheval, P. Rogrway, Relations Among Notions of Security for Public- Key Encryption Schemes, Crypto' 98, LNCS 1462, Springer Verlag, Berlin 1998, 26-45
7. M. Blum, S. Micali, How To Generate Cryptographically Strong Sequences Of Pseudo Random Bits, 23rd Symposium on Foundations of Computer Science (FOCS), IEEE, 1982, 122-177
8. R. Canetti, Studies in Secure Multiparty Computation and Applications, Thesis, Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, June 1995, revised March 1996
9. R. Canetti, Security and Composition of Multi-Party Cryptographic Protocols, Theory of Cryptography Library 98-18, June 1998, last revision August 1999, http://philby.ucsd.edu/cryptolib/.
10. R. CAntti, S. Goldwasser An efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack, Eurocrypt '99, LNCS 1592, Springer-Verlag, Berlin 1999, 90-106
11. R. Cramer, V. Shoup, A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack, Crypto '98, LNCS 1462, Springer-Verlag, Berlin 1998, 13-25
12. Dolev D., Yao A.C. On the Security of Public Key Protocols. IEEE Transactions on Information Theory. 29/2:1983;198-208
13. S. Even, O. goldreich, A. Shamir, On the Security of Ping-Pong Protocols when Implemented using the RSA, Crypto '85, LNCS 218, Springer-Verlag, Berlin 1986, 58-72
14. R. Gennaro, S. Micali, Verifiable Secret Sharing as Secure Computation, Eurocrypt '95, LNCS 921, Springer-Verlafg, Berlin 1995, 168-182
15. O. Goldreich, Secure Multi-Party Computation, Working Draft, Version 1.1, September 21, 1998, available from http://www.wisdom.weizmann.ac.il/users/oded/ pp.htm.
16. O. Goldreuich, S. Micali, A. Wigderson, How to play any mental game -or-a completeness theorem for protocols with honest majority, 19th Symposium on Theory of Comlputing (STOC), ACM, New York 1987, 218-229
17. S. Goldwasser, L. Levin, Fair Computation of General Functions in Presence of Immoral Majority, Crypto '90, LNCS 537, Springer-Verlag, Berlin 1991, 77-93
18. Goldwasser S., Micali S., Rackoff C. The Knowledge Complexity of Interactive Prrof Systems. SIAM Journal on Computing. 18/1:1989;186-207
19. M. Hirt, U. Maurer, Player Simulation and General Adversary Structures in Perfect Multi-Party Computation, Swiss Federal Institute of Technology (ETH), Zurich, Dec. 1997, invited to a special issue of Journal of Cryptology, available from http://www.inf.ethzch/personal/hirt/publications/journal.ps.gz.
20. J. Jacobs, Security specifications, 1988 Symposium on Security and Privacy, IEEE, Washington 1988, 14-23
21. E. S. Lee, B. W. Thomson P.I.P. Boulton, R.E. Soper, Composable Trusted Systems CSRI, University of Toronto, Report CSRI-272, May 1992.
22. P. Lincoln, J. Mitchell, M. Mitchell, A Mitchell, A. Scredrov A probabilistic Ploy-time Framework for protocol Analysis, 5th Conference on Computer and Communications Security, ACM, New York 1998 112-121.
23. P. Lincoln, J. Mitchell, M. Mitchell, A. Scedrov, Probabilistic Polynomial-Time Equivalence and Security Analysis, Formal Methods 1999, available at ftp://theory.stanford.edu/pub/jcm/papers/fm-99.ps
24. G. Lowe, Breaking and fixing the Needham-Schroeder public-key protocol using FDR, Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 1055, Springer-Verlag, Berlin 1996, 147-166
25. C. Meadows, Using Narrowing in the Analysis of Key Management Protocols, 1989 Symposium on Security and Privacy, IEEE, Washington 1989, 138-147
26. Micali S.L., Rackoff C., Sloan B. The Notion of Security for Probabilistic Cryptosystems. SIAM Journal on Computing. (17/2):1988;412-426
27. S. Micali, P. Rogaway, Secure Computation, Crypto '91, LNCS 576, Springer-Verlag, Berlin 1992, 392-404
28. J.K. Millen, The Interrogator: A Tool for Cryptographic Protocol Security, 1984 IEEE Symposium on Security and Privacy, IEEE, Washington 1984134-141
29. B. Pfitzmann, Sorting Out Signature Schemes, 1st Conference on Computer and Communications Security, ACM, New York 1993, 74-85
30. B. Pfitzmann, Cryptographic Semantics of Formal Specifications, presented at Colloquium on Formal Methods and Security, Isaac Newton Institute, University of Cambridge, April 23, 1996
31. B. Pfitzmann, Digital Signature Schemes-General Framework and Fail-Stop Signatures, LNCS 1100, Springer-Verlag, Berlin 1996
32. B. Pfitzmann, M. Schunter, M. Waidner, Secure Reactive Systems, IBM Research Report RZ 3206 (#93252), IBM Research Division, Zürich, Feb. 2000
33. B. Pfitzmann, M. Schunter, M. Waidner, Provably Secure Certified Mail, IBM Research Report RZ 3207 (#93253), IBM Research Division, Zürich, Feb. 2000
34. B. Pfitzmann, M. Waidner, A GEnerakl Framework for Formal Notions of "Secure" System, Hildesheimer Informatik-Berichte 11/94, Universität Hildesheim, April 1994, available at http://www.semper.ort/ sirene/lit/abstr94.html#PfWa_94.
35. B. Pfitzmann, M. Waidner, Extensions to Multi-Party Computations, The 1998 Weizmann Workshop on Cryptography, June 16-18th, Rehovot, Israel, slides available at http://www.semper.org/sirene/lit/abstr98.html#PfWa3_98.
36. A. W. Roscoe, Modelling and Verifying Key-Exchange Protocols Using CSP and FDR, 8th Computer Security Foundations Workshop, IEEE, Los Alamitos 1995, 98-107
37. S. Schneider, A. Sidiropoulos, CSP and Anonymity, 4th European Symposium on Research in Computer Security (ESORICS), LNCS 1146, Springer - Verlag, Berlin 1996, 198-218
38. V. Shoup, On Formal Models for Secure Key Exchange, IBM Research Report rz 3076 (##93122), IBM Research Division, Zürich, November 1998, also Theory of Cryptography Library 99-12, last revised November 1999, http://philby.ucsd.edu/cryptolib/.
39. P. Syverson, C. Meadows, A Logical Logical Language for Specifying Cryptographic Protocol Requirements, 1993 Symposium on Research in Security and Privacy, IEEE, Los Alamitos 1993, 165-177
40. Toussaint M.J. A New Method for Analyzing the Security of Cryptographic protocols. IEEE Journal on Selected Areas in Communications. 11/5:1993;702-714
41. G. Wedel, V. Kessler, Formal Semantics for Authentication Logics, 4th European Symposium on Research in Computer Security (ESORICS), LNCS 1146, Springer-Verlag, Berlin 1996, 219-241
42. A.C. Yao, Protocols for Secure Computations, 23rd Symposium on Foundations of Computer Science (FOCS), IEEE, 1982, 160-164
43. A. C. Yao Theory and Applications of Trapdoor Functions, 23rd Symposium on Foundations of Computer Science (FOCS), IEEE, 1982, 80-91