Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Obtaining Universally Compoable Security: Towards the Bare Bones of Trust

Ran Canetti

Published Nov 4, 2007• 26 citations
Publisher
DOI
10.1007/978-3-540-76900-2_6

Related papers

Secure Protocols with Asymmetric Trust

Ivan Damgård, Yvo Desmedt, Matthias Fitzi +1 more

Springer eBooks•Nov 4, 2007•31 citations

Obtaining Universally Composable Security: Towards the Bare Bones of Trust.

Ran Canetti

A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) security provides this guarantee in a strong sense: A UC-secure protocol maintains its security properties even when composed concurrently with an unbounded number of instances of arbitrary protocols. However, many interesting cryptographic tasks are provably impossible to realize with UC security in the standard, “plain” model of computation. Impossibility holds even if ideally authenticated communication channels are provided. In contrast, it has been demonstrated that general secure computation can be obtained in a number of idealized models. Each one of these models represents a form of trust that is put in some of the system’s components. This survey examines and compares some of these trust models, both from the point of view of their sufficiency for building UC secure protocols, and from the point of view of their practical realizability. We start with the common reference string (CRS) model, and then describe several relaxations and alternatives including the Defective CRS model, the key registration models, the hardware token model, the global and augmented CRS models, and a timing assumption. Finally, we briefly touch upon trust models for obtaining authenticated communication.

•Jan 1, 2007•5 citations

Trusted Quantum Back Bone Leveraging Secure Communication

Benjamin Rainer, Oliver Maurhart

Quantum science and technology•Jan 1, 2020•0 citations

Universally composable security of identity-based signature schemes

Zecheng Wang

Journal of Computer Applications•Mar 21, 2011•0 citations

Bare-bones multi-scale quantum harmonic oscillator algorithm for global optimization

Benjun Guo, Jin Jin, Yuanping Xu +2 more

Expert Systems with Applications•Sep 29, 2023•1 citation

Almost-Everywhere Secure Computation

Juan A. Garay, Rafail Ostrovsky

Springer eBooks•Apr 4, 2008•56 citations
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) security provides this guarantee in a strong sense: A UC-secure protocol maintains its security properties even when composed concurrently with an unbounded number of instances of arbitrary protocols. However, many interesting cryptographic tasks are provably impossible to realize with UC security in the standard, “plain” model of computation. Impossibility holds even if ideally authenticated communication channels are provided. In contrast, it has been demonstrated that general secure computation can be obtained in a number of idealized models. Each one of these models represents a form of trust that is put in some of the system’s components. This survey examines and compares some of these trust models, both from the point of view of their sufficiency for building UC secure protocols, and from the point of view of their practical realizability. We start with the common reference string (CRS) model, and then describe several relaxations and alternatives including the Defective CRS model, the key registration models, the hardware token model, the global and augmented CRS models, and a timing assumption. Finally, we briefly touch upon trust models for obtaining authenticated communication.