Composition and integrity preservation of secure reactive systems

By Birgit Pfitzmann, Michael Waidner. Conference on Computer and Communications Security, 2000

314 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/4bdb9517632ca54617b0e22c13f311d36cdc4d21

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 Computer Networks and Communications

Citations in the corpus

Security of quantum key distribution (2005, background): “niversal security has attracted a lot of interest and led to important new deﬁnitions and proofs (see, e.g., the so-called universal composability framework of Canetti [Can01] or Pﬁtzmann and Waidner [PW00]). Recently, Ben-Or and Mayers [BOM04] and Unruh [Unr04] have generalized Canetti’s notion of ”
Universally Composable Two-Party and Multi-party Secure Computation (unknown): “, [34, 40, 1, 42, 9]), the security requirements of a given task (i.”
Founding Cryptography on Oblivious Transfer - Efficiently (2008, methodology): “(Our protocols can also be analyzed in the stand-alone setting, using the composability framework of [9, 24], or in other UC-like frameworks, like that of [43].”
Universally Composable Security with Global Setup (2007, background): “Several formalizations of the above intuitive idea exist, e.g. [24, 31, 2, 10, 21, 36, 11, 35].”
Universally composable two-party and multi-party secure computation (2002, unknown): “As in other general definitions (e.g., [gl90, mr91, b91, pw00 , c00]), the security requirements of a given task (i.e., the functionality expected from a protocol that carries out the task) are captured via a set of instructions for a “trusted party” that obtains the inputs of the participants and ”
Universally composable signature, certification, and authentication (2004, background): “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]).”
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].”
A model for asynchronous reactive systems and its application to secure message transmission (2001, methodology): “Among the reactive models, the only composition theorem so far is in [30], i.”
Universally composable security: a new paradigm for cryptographic protocols (2001, background): “( For instance, this is the main motivation in [ MR 91, C 00, DM 00, PW 00].)”
Advances in quantum cryptography (2019, unknown): “The concept of composability was first introduced in classical cryptography [66–69] before being generalized to the quantum setting [70–72].”
A Pragmatic Introduction to Secure Multi-Party Computation (2019, methodology): “While the UC framework is the most popular model with this property, there are other models with similar guarantees (Pfitzmann and Waidner, 2000; Hofheinz and Shoup, 2011).”
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.”