{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:27:15Z","timestamp":1761596835995},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(04)00095-7","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T10:14:39Z","timestamp":1075371279000},"page":"59-77","source":"Crossref","is-referenced-by-count":26,"special_numbering":"C","title":["Cryptographic Security of Reactive Systems"],"prefix":"10.1016","volume":"32","author":[{"given":"Birgit","family":"Pfitzmann","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Schunter","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Waidner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB1","doi-asserted-by":"crossref","unstructured":"M. Abadi, Protection in Programming-Language Translations, 25th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 1443, Springer-Verlag, Berlin 1998, 868\u2013883","DOI":"10.1007\/BFb0055109"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB2","doi-asserted-by":"crossref","unstructured":"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\u201347","DOI":"10.1145\/266420.266432"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB3","doi-asserted-by":"crossref","unstructured":"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\u2013216","DOI":"10.1145\/112600.112618"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB4","doi-asserted-by":"crossref","unstructured":"D. Beaver, Secure Multiparty Protocols and Zero Knowledge Proof Systems Tolerating a Faulty Minority, Journal of Cryptology 4\/2 (1991) 75\u2013122","DOI":"10.1007\/BF00196771"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB5","doi-asserted-by":"crossref","unstructured":"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\u2013428","DOI":"10.1145\/276698.276854"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB6","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Desai, D. Pointcheval, P. Rogaway, Relations Among Notions of Security for Public- Key Encryption Schemes, Crypto' 98, LNCS 1462, Springer\ue4f8Verlag, Berlin 1998, 26\u201345","DOI":"10.1007\/BFb0055718"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB7","doi-asserted-by":"crossref","unstructured":"M. Blum, S. Micali, How To Generate Cryptographically Strong Sequences Of Pseudo Random Bits, 23rd Symposium on Foundations of Computer Science (FOCS), IEEE, 1982, 112\u2013117","DOI":"10.1109\/SFCS.1982.72"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB8","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/SFCS.1996.548509"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB9","unstructured":"R. Canetti, Security and Composition of Multi-Party Cryptographic Protocols, Theory of Cryptography Library 98\u201318, June 1998, last revision August 1999, http:\/\/philby.ucsd.edu\/cryptolib\/."},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB10","doi-asserted-by":"crossref","unstructured":"R. Canetti, S. Goldwasser An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack, Eurocrypt '99, LNCS 1592, Springer-Verlag, Berlin 1999, 90\u2013106","DOI":"10.1007\/3-540-48910-X_7"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB11","doi-asserted-by":"crossref","unstructured":"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\u201325","DOI":"10.1007\/BFb0055717"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB12","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","article-title":"On the Security of Public Key Protocols","volume":"29\/2","author":"Dolev","year":"1983","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB13","doi-asserted-by":"crossref","unstructured":"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\u201372","DOI":"10.1007\/3-540-39799-X_7"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB14","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Micali, Verifiable Secret Sharing as Secure Computation, Eurocrypt '95, LNCS 921, Springer-Verlag, Berlin 1995, 168\u2013182","DOI":"10.1007\/3-540-49264-X_14"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB15","unstructured":"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."},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB16","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game\u2014or\u2014a completeness theorem for protocols with honest majority, 19th Symposium on Theory of Computing (STOC), ACM, New York 1987, 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB17","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, L. Levin, Fair Computation of General Functions in Presence of Immoral Majority, Crypto '90, LNCS 537, Springer-Verlag, Berlin 1991, 77\u201393","DOI":"10.1007\/3-540-38424-3_6"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB18","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","article-title":"The Knowledge Complexity of Interactive Proof Systems","volume":"18\/1","author":"Goldwasser","year":"1989","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB19","unstructured":"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.ethz.ch\/personal\/hirt\/publications\/journal.ps.gz."},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB20","doi-asserted-by":"crossref","unstructured":"J. Jacobs, Security specifications, 1988 Symposium on Security and Privacy, IEEE, Washington 1988, 14\u201323","DOI":"10.1109\/SECPRI.1988.8094"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB21","unstructured":"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."},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB22","doi-asserted-by":"crossref","unstructured":"P. Lincoln, J. Mitchell, M. Mitchell, A. Scredrov A probabilistic Poly-time Framework for protocol Analysis, 5th Conference on Computer and Communications Security, ACM, New York 1998 112\u2013121.","DOI":"10.1145\/288090.288117"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB23","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/3-540-48119-2_43"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB24","doi-asserted-by":"crossref","unstructured":"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\u2013166","DOI":"10.1007\/3-540-61042-1_43"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB25","doi-asserted-by":"crossref","unstructured":"C. Meadows, Using Narrowing in the Analysis of Key Management Protocols, 1989 Symposium on Security and Privacy, IEEE, Washington 1989, 138\u2013147","DOI":"10.1109\/SECPRI.1989.36288"},{"issue":"17\/2","key":"10.1016\/S1571-0661(04)00095-7_NEWBIB26","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1137\/0217025","article-title":"The Notion of Security for Probabilistic Cryptosystems","author":"Micali","year":"1988","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB27","doi-asserted-by":"crossref","unstructured":"S. Micali, P. Rogaway, Secure Computation, Crypto '91, LNCS 576, Springer-Verlag, Berlin 1992, 392\u2013404","DOI":"10.1007\/3-540-46766-1_32"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB28","doi-asserted-by":"crossref","unstructured":"J.K. Millen, The Interrogator: A Tool for Cryptographic Protocol Security, 1984 IEEE Symposium on Security and Privacy, IEEE, Washington 1984134\u2013141","DOI":"10.1109\/SP.1984.10003"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB29","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann, Sorting Out Signature Schemes, 1st Conference on Computer and Communications Security, ACM, New York 1993, 74\u201385","DOI":"10.1145\/168588.168597"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB30","unstructured":"B. Pfitzmann, Cryptographic Semantics of Formal Specifications, presented at Colloquium on Formal Methods and Security, Isaac Newton Institute, University of Cambridge, April 23, 1996"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB31","unstructured":"B. Pfitzmann, Digital Signature Schemes\u2014General Framework and Fail-Stop Signatures, LNCS 1100, Springer-Verlag, Berlin 1996"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB32","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann, M. Schunter, M. Waidner, Secure Reactive Systems, IBM Research Report RZ 3206 (#93252), IBM Research Division, Z\u00fcrich, Feb. 2000","DOI":"10.1016\/S1571-0661(04)00095-7"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB33","unstructured":"B. Pfitzmann, M. Schunter, M. Waidner, Provably Secure Certified Mail, IBM Research Report RZ 3207 (#93253), IBM Research Division, Z\u00fcrich, Feb. 2000"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB34","unstructured":"B.M. Waidner, A General Framework for Formal Notions of \u201cSecure\u201d System, Hildesheimer Informatik-Berichte 11\/94, Universit\u00e4t Hildesheim, April 1994, available at http:\/\/www.semper.ort\/sirene\/lit\/abstr94.html#PfWa_94."},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB35","unstructured":"B. Pfitzmann, M. Waidner, Extensions to Multi-Party Computations, The 1998 Weizmann Workshop on Cryptography, June 16\u201318th, Rehovot, Israel, slides available at http:\/\/www.semper.org\/sirene\/lit\/abstr98.html#PfWa3_98."},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB36","doi-asserted-by":"crossref","unstructured":"A. W. Roscoe, Modelling and Verifying Key-Exchange Protocols Using CSP and FDR, 8th Computer Security Foundations Workshop, IEEE, Los Alamitos 1995, 98\u2013107","DOI":"10.1109\/CSFW.1995.518556"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB37","doi-asserted-by":"crossref","unstructured":"S. Schneider, A. Sidiropoulos, CSP and Anonymity, 4th European Symposium on Research in Computer Security (ESORICS), LNCS 1146, Springer \u2014 Verlag, Berlin 1996, 198\u2013218","DOI":"10.1007\/3-540-61770-1_38"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB38","unstructured":"V. Shoup, On Formal Models for Secure Key Exchange, IBM Research Report RZ 3076 (##93122), IBM Research Division, Z\u00fcrich, November 1998, also Theory of Cryptography Library 99\u201312, last revised November 1999, http:\/\/philby.ucsd.edu\/cryptolib\/."},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB39","doi-asserted-by":"crossref","unstructured":"P. Syverson, C. Meadows, A Logical Language for Specifying Cryptographic Protocol Requirements, 1993 Symposium on Research in Security and Privacy, IEEE, Los Alamitos 1993, 165\u2013177","DOI":"10.1109\/RISP.1993.287634"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB40","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/49.223870","article-title":"A New Method for Analyzing the Security of Cryptographic protocols","volume":"11\/5","author":"Toussaint","year":"1993","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB41","doi-asserted-by":"crossref","unstructured":"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\u2013241","DOI":"10.1007\/3-540-61770-1_39"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB42","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Protocols for Secure Computations, 23rd Symposium on Foundations of Computer Science (FOCS), IEEE, 1982, 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"10.1016\/S1571-0661(04)00095-7_NEWBIB43","doi-asserted-by":"crossref","unstructured":"A. C. Yao,Theory and Applications of Trapdoor Functions, 23rd Symposium on Foundations of Computer Science (FOCS), IEEE, 1982, 80\u201391","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000957?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000957?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:29:46Z","timestamp":1585484986000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104000957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":43,"alternative-id":["S1571066104000957"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00095-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}