The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
A model for asynchronous reactive systems and its application to secure message transmission
Abstract
We present a rigorous model for secure reactive systems in asynchronous networks with a sound cryptographic semantics, supporting abstract specifications and the composition of secure systems. This enables modular proofs of security, which is essential in bridging the gap between the rigorous proof techniques of cryptography and tool-supported formal proof techniques. The model follows the general simulatability approach of modern cryptography. A variety of network structures and trust models can be described such as static and adaptive adversaries, some examples of this are given. As an example of our specification methodology we provide an abstract and complete specification for Secure Message Transmission, improving on recent results by Lynch (1999), and verify one concrete implementation. Our proof is based on a general theorem on the security of encryption in a reactive multi-user setting, generalizing a recent result by Bellare et. al (2000).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On the security of public key protocols
Dolev, D., & Yao, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,833
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61769-8 · Cited by 1,865
Security and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,403
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*
Abadi, M., & Rogaway, P. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0014-7 · Cited by 613
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
Bellare, M., Boldyreva, A., & Micali, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_18 · Cited by 519
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols.
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Cited by 381
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276854 · Cited by 358
Fair Computation of General Functions in Presence of Immoral Majority
Goldwasser, S., & Levin, L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_6 · Cited by 353
Composition and integrity preservation of secure reactive systems
Pfitzmann, B., & Waidner, M. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352639 · Cited by 277
Self-citationPlayer Simulation and General Adversary Structures in Perfect Multiparty Computation
Hirt, M., & Maurer, U. (2000) · Journal of Cryptology · doi:10.1007/s001459910003 · Cited by 233
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
Beaver, D. (1991) · Journal of Cryptology · doi:10.1007/bf00196771 · Cited by 228
A probabilistic poly-time framework for protocol analysis
Lincoln, P., Mitchell, J., Mitchell, M., & Scedrov, A. (1998) · Proceedings of the 5th ACM conference on Computer and communications security · doi:10.1145/288090.288117 · Cited by 209
Reconciling Two Views of Cryptography
Abadi, M., & Rogaway, P. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44929-9_1 · Cited by 142
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
Canetti, R., & Goldwasser, S. (1999) · Cited by 140
Cryptographic Protocols Provably Secure Against Dynamic Adversaries
Beaver, D., & Haber, S. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_26 · Cited by 132
Probabilistic Polynomial-Time Equivalence and Security Analysis
Lincoln, P. D., Mitchell, J. C., Mitchell, M., & Scedrov, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48119-2_43 · Cited by 75
Cryptographic Security of Reactive Systems
Pfitzmann, B., Schunter, M., & Waidner, M. (2000) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)00095-7 · Cited by 60
Self-citationPfitzmann, B., Schunter, M., & Waidner, M. (2000) · Cited by 43
Self-citationVerifiable Secret Sharing as Secure Computation
Gennaro, R., & Micali, S. M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x_14 · Cited by 33
Provably Secure Certified Mail
Pfitzmann, B., Schunter, M., & Waidner, M. (2000) · Cited by 14
Self-citation
Cited by
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Canetti, R., & Krawczyk, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_28 · Cited by 1,653
Brickell, E., Camenisch, J., & Chen, L. (2004) · Proceedings of the 11th ACM conference on Computer and communications security · doi:10.1145/1030083.1030103 · Cited by 935
Universally Composable Commitments
Canetti, R., & Fischlin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_2 · Cited by 621
Metadata
- Authors
- Pfitzmann, B., & Waidner, M.
- Venue
- Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-13
- Pages
- 184-200
- OpenAlex
- W2119708968
- Cited by
- 349
- References
- 29
- FWCI
- 28.82
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.