Universal composability

The framework of universal composability (UC)^[1] 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 (without having access to the code). The notion of security is derived by implication. Assume a protocol ${\displaystyle P_{1}}$ is secure per definition. If another protocol ${\displaystyle P_{2}}$ emulates protocol ${\displaystyle P_{1}}$ such that no environment tells apart the emulation from the execution of the protocol, then the emulated protocol ${\displaystyle P_{2}}$ is as secure as protocol ${\displaystyle P_{1}}$.

An ideal functionality is a protocol in which a trusted party that can communicate over perfectly secure channels with all protocol participants computes the desired protocol outcome. We say that a cryptographic protocol that cannot make use of such a trusted party fulfils an ideal functionality, if the protocol can emulate the behaviour of the trusted party for honest users, and if the view that an adversary learns by attacking the protocol is indistinguishable from what can be computed by a simulator that only interacts with the ideal functionality.

The computation model of universal composability is that of interactive Turing machines that can activate each other by writing on each other's communication tapes. An interactive Turing machine is a form of multi-tape Turing machine and is commonly used for modelling the computational aspects of communication networks in cryptography.

The communication model in the bare UC framework is very basic. The messages of a sending party are handed to the adversary who can replace these messages with messages of his own choice that are delivered to the receiving party. This is also the Dolev-Yao threat model. (Based on the computational model all parties are modeled as interactive turing machines)

All communication models that add additional properties such as confidentiality, authenticity, synchronization, or anonymity are modeled using their own ideal functionality. An ideal communication functionality takes a message as input and produces a message as output. The (more limited) powers for the adversary ${\displaystyle {\mathcal {A}}}$ are modeled through the (limited) capacity of the adversary to interact with this ideal functionality.

For an optimal ideal authenticated channel, the ideal functionality ${\displaystyle {\mathcal {F}}_{\mathsf {Auth}}}$ takes a message ${\displaystyle m}$ from a party with identity ${\displaystyle P}$ as input, and outputs the same message together with the identity ${\displaystyle P}$ to the recipient and the adversary. To model the power of the adversary to delay asynchronous communication the functionality ${\displaystyle {\mathcal {F}}_{\mathsf {Auth}}}$ may first send a message to the adversary ${\displaystyle {\mathcal {A}}}$ and would only deliver the message ${\displaystyle m,P}$ once it receives the command to do so as a reply.

In an ideal secure channel, the ideal functionality ${\displaystyle {\mathcal {F}}_{\mathsf {Sec}}}$ only outputs the identity of the sender to both the recipient and the adversary, while the message is only revealed to the recipient. This models the requirement that a secure channel is both authenticated and private. To model some leakage about the information that is being transferred, ${\displaystyle {\mathcal {F}}_{\mathsf {Sec}}}$ may reveal information about the message to the adversary, e.g. the length of the message. Asynchronous communication is modeled through the same delay mechanism as for ${\displaystyle {\mathcal {F}}_{\mathsf {Auth}}}$.

While the technical means, and the physical assumptions behind anonymous and pseudonymous communication are very different,^[2] the modeling of such channels using ideal functionalities is analogous. See also onion routing and Anonymous P2P. Similar functionalities can be defined for broadcast communication, or synchronous communication.

In an ideal anonymous channel, the ideal functionality, ${\displaystyle {\mathcal {F}}_{\mathsf {Anon}}}$ takes a message ${\displaystyle m}$ from a party with identity ${\displaystyle P}$ as input, and outputs the same message but without disclosing the identity ${\displaystyle P}$ to the recipient and the adversary.

In an ideal pseudonymous channel, the participating parties first register unique pseudonyms with the ideal functionality ${\displaystyle {\mathcal {F}}_{\mathsf {Pseu}}}$. To do a transfer ${\displaystyle {\mathcal {F}}_{\mathsf {Pseu}}}$ takes a message ${\displaystyle m}$ and the pseudonym ${\displaystyle nym}$ of the recipient as input. The ideal functionality looks up the owner of the pseudonym and transfers the message ${\displaystyle m,nym}$ without revealing the identity of the sender.

These formalisations abstract from the implementation details of the concrete systems that implement such channels. In their pure form an ideal functionality may be found to be unrealizable. It may be necessary to relax the functionality by leaking more information to the adversary (degree of anonymity). On the other hand communication channels can be physical,^[3][4] e.g. a mobile device can achieve an anonymous channel by constantly changing its location before transmitting messages that do not contain identifiers.

There exists no bit commitment protocol that is universally composable in the Standard Model. The intuition is that in the ideal model, the simulator has to extract the value to commit to from the input of the environment. This would allow the receiver in the real protocol to extract the committed value and break the security of the protocol. This impossibility result can be applied to other functionalities.

To circumvent the above impossibility result, additional assumptions are required. Additional setup and trust assumptions, such as the common reference string model and the assumption of a trusted certification authority are also modeled using ideal functionalities in UC.

• Reactive Simulatability ^[5] is a similar model developed concurrently with the universal composability model.
• Abstract/Constructive Cryptography ^[6][7] is a more recent general-purpose model for the composable analysis of cryptographic protocols.
• The GNUC and IITM model are reformulations of universal composability by other researcher (prominently, Victor Shoup and Ralf Kuesters) that influenced new versions of the canonical model by Ran Canetti.

• Abstraction
• Burrows-Abadi-Needham logic
• Hybrid argument
• Mathematical model
• Secure multi-party computation