Live briefing
Everything about Universal composability
Cryptographic framework
The framework of universal composability (UC) is a general-purpose model for the analysis of cryptographic protocols. It guarantees very strong security properties. Protocols remain secure even if arbitrarily composed with other instances of the same or other protocols. Security is defined in the sense of protocol emulation. Intuitively, a protocol is said to emulate another one, if no environment (observer) can distinguish the executions. Literally, the protocol may simulate the other protocol. The notion of security is derived by implication. Assume a protocol is secure per definition. If another protocol emulates protocol such that no environment tells apart the emulation from the execution of the protocol, then the emulated protocol is as secure as protocol. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Universal composabilityA 5-minute orientation
- Skim a recent paper: Simple, Efficient, and Universal Energy Decomposition Analysis Method Based on Dispersion-Corrected Density Functional TheoryInfluential work since 2022
- Pick up a classic book: The Big MusicThe most-reprinted book on the subject
- Read the landmark paper: GNUC: A New Universal Composability FrameworkCited 44 times
- Go sideways: Noisy-storage modelA closely related topic
- Go sideways: Secure multi-party computationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
GNUC: A New Universal Composability Framework
Beyond the Shannon–Khinchin formulation: The composability axiom and the universal-group entropy
The IITM Model: A Simple and Expressive Model for Universal Composability
Long-Term Security and Universal Composability
Identity-Based Proxy Signcryption Protocol with Universal Composability
General Composition and Universal Composability in Secure Multiparty Computation
Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs
An optimistic fair exchange protocol and its security in the universal composability framework
🆕 Influential since 2022
Simple, Efficient, and Universal Energy Decomposition Analysis Method Based on Dispersion-Corrected Density Functional Theory
Graphene composites with Ru-RuO2 heterostructures: Highly efficient Mott–Schottky-type electrocatalysts for pH-universal water splitting and flexible zinc–air batteries
Core–Shell Engineering of Conductive Fillers toward Enhanced Dielectric Properties: A Universal Polarization Mechanism in Polymer Conductor Composites
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability
Universal Composability Is Robust Compilation
📚 Books worth reading
The Big MusicKirsty Gunn · 2012
Music and musicians in early AmericaIrving Lowens · 1964- 📕Compositional CrossroadsEleanor V. Stubley · 2007
From Spirituals to SymphoniesHelen Walker-Hill · 2002
ViennaLeon Botstein · 2004- 📕Heinrich Schenker, Oswald Jonas, Moriz ViolinUniversity of California, Riverside. Library., Robert Lang · 1994
- 📕Richard WagnerKapp, Julius · 1910
Franz LisztManfred Wagner · 2000
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Noisy-storage model The noisy-storage model refers to a cryptographic model employed in quantum cryptography. It assumes that the quantum memory device of an attacker (adversary)…
- Secure multi-party computation Secure multi-party computation (also known as secure computation, multi-party computation (MPC) or privacy-preserving computation) is a subfield of cryptography…
- Identity-based encryption Identity-based encryption (IBE), is an important primitive of identity-based cryptography. As such it is a type of public-key encryption in which the public…
- Pseudorandom function family In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracle in…
- Quantum coin flipping Consider two remote players, connected by a channel, that don't trust each other. The problem of them agreeing on a random bit by exchanging messages over…
- Cryptographic protocol A cryptographic protocol is an abstract or concrete protocol that performs a security-related function and applies cryptographic methods, often as sequences…
- Private simultaneous message passing Private simultaneous message passing (PSM) is a primitive, studied in information-theoretic cryptography, which allows multiple, non-communicating, parties…
- Quantum cryptography Quantum cryptography is the exploiting of quantum-mechanical properties such as quantum entanglement, measurement disturbance, no-cloning theorem, and…