Universally composable security: a new paradigm for cryptographic protocols

By Ran Canetti. 2001

3,703 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Information Systems

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

In Information Systems

Citations in the corpus

Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts (2018, positive): “It aims to realize a Universal Composability (UC) [17] ideal functionality FEkiden that we defer to Appendix A for lack of space and encourage the reader to consult.”
Step by Step Towards Creating a Safe Smart Contract: Lessons and Insights from a Cryptocurrency Lab (2016, methodology): “In general, for secure composition of computationally sound primitives, we would recommend the usage of universally composable commitments [10–12].”
Dynamic Searchable Encryption via Blind Storage (2014, background): “Thanks to the encryption, it is easy to enforce that the contents of these downloaded blocks give virtually no information to the server (beyond the size of f).”
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody (2018, background): “We remark that when all of the zero-knowledge proofs are UC secure [6], then our protocol can also be proven secure in this framework.”
Universally composable two-party and multi-party secure computation (2002, methodology): “recently proposed framework of universally composable security [10] which builds and extends on many previous works, e.”
SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority (2018, neutral): “For such a formalization see, for example, the Universal Composability Framework (UC) [4].”
On Signatures of Knowledge (2006, background): “For a detailed discussion and justification for Canetti’s modelling choices see [9].”
Efficient, Robust and Constant-Round Distributed RSA Key Generation (2010, methodology): “We use the Universal Composability (UC) framework [7,8] to specify the security of our protocols.”
Town Crier: An Authenticated Data Feed for Smart Contracts (2016, neutral): “While we introduce them in this work, as we shall explain, they are of broad and general applicability.”
Fairplay - Secure Two-Party Computation System (2004, background): “This scenario, as well as appropriate security definitions and constructions, was described in [10, 12].”
HOP: Hardware makes Obfuscation Practical (2017, background): “Putting it all together, we provide a formal proof of security for the entire system under the universally composable (UC) simulation framework [10].”
Chosen-ciphertext secure proxy re-encryption (2007, methodology): “the universally composable (UC) framework [9].”
Founding Cryptography on Oblivious Transfer - Efficiently (2008, methodology): “– Security: Π UC-securely realizes the functionality F , against adaptive corruption of up to t servers, and either static or adaptive corruption of any number of clients (see Remark 2).”
HMQV: A High-Performance Secure Diffie-Hellman Protocol (2005, methodology): “We prove that in the random oracle model [5], and under the Computational Diffie-Hellman (CDH) assumption [15], the protocol is secure in the Canetti-Krawczyk security model [11].”
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology (2004, background): “of cryptosystems, i.e., it needs to be specified what it means for a cryptosystem C to be at least as secure as another cryptosystem C0. Our definition is based on ideas proposed by Canetti [3, 4 ],”
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority (2016, methodology): “) Using the fact that all our protocols are UC secure from [17] and thus applying the UC composition theorem of [7], we conclude with the following theorem:”
Scyther : semantics and verification of security protocols (2006, background): “Alternative requirements addressing protocol interference in various settings are found in [93, 48, 47].”