A model for asynchronous reactive systems and its application to secure message transmission

By Birgit Pfitzmann, Michael Waidner. Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001, 2001

398 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Sociology and Political Science

View Paper: https://www.semanticscholar.org/paper/e8d2cafac32e80e02cd6990c0afd65506101359e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Sociology and Political Science

Citations in the corpus

Universally composable signature, certification, and authentication (2004, methodology): “Specifically, in both frameworks mentioned above security was shown to be preserved under a very general composition operation called universal composition (see [c01], and [bpw04] based on [pw00, pw01 ]).”
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology (2004, background): “and by Pfitzmann and Waidner [12, 13 ] (for the case of static adversaries), adapted to our general notion of systems.”
Universally Composable Commitments (2001, methodology): “This framework builds on known denitions for function evaluation and general tasks [ gl90, mr91, b91, pw94, c00, dm00, pw01 ], and allows dening the security properties of practically any cryptographic task.”
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels (2001, background): “A promising general approach for the analysis of reactive protocols and their concurrent composition has been developed by Pfitzmann, Schunter and Waidner [32,31,33] and Canetti [12].”
A protocol for property-based attestation (2006, methodology): “We analyzed the security of the PBA protocol in a formal model based on the simulatability paradigm, as proposed in [9] and [26].”
Direct anonymous attestation (2004, methodology): “As in [7], we use an idealsystem/real-system model to prove security based on security models for multi-party computation [15, 16] and reactive systems [32, 33].”
Advances in quantum cryptography (2019, neutral): “The concept of composability was first introduced in classical cryptography [66–69] before being generalized to the quantum setting [70–72].”
Quantum And Relativistic Protocols For Secure Multi-Party Computation (2009, methodology): “The universal security framework of Canetti [51], and the reactive simulatability framework of Backes, Pfitzmann and Waidner [52, 53] try to capture this idea in a classical context and have recently been extended and used in quantum scenarios [54–56].”