Universal Composition with Joint State
Ran Canetti,Tal Rabin +1 more
- 17 Aug 2003
- pp 265-281
TL;DR: In this paper, the authors propose a new composition operation called universal composition with joint state and randomness, which is based on the universal composition operation and can handle the case where different components have some amount of joint state.
read more
Abstract: Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples include systems where multiple protocol instances use the same public-key infrastructure, or the same common reference string.) Rather than attempting to analyze the entire system as a single unit, we would like to be able to analyze each such protocol instance as stand-alone, and then use a general composition theorem to deduce the security of the entire system. However, no known composition theorem applies in this setting, since they all assume that the composed protocol instances have disjoint internal states, and that the internal random choices in the various executions are independent. We propose a new composition operation that can handle the case where different components have some amount of joint state and randomness, and demonstrate sufficient conditions for when the new operation preserves security. The new operation, which is called universal composition with joint state (and is based on the recently proposed universal composition operation), turns out to be very useful in a number of quite different scenarios such as those mentioned above.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Universally composable security: a new paradigm for cryptographic protocols
Ran Canetti
- 14 Oct 2001
TL;DR: The notion of universally composable security was introduced in this paper for defining security of cryptographic protocols, which guarantees security even when a secure protocol is composed of an arbitrary set of protocols, or more generally when the protocol is used as a component of a system.
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Ahmed E. Kosba,Andrew Miller,Elaine Shi,Zikai Wen,Charalampos Papamanthou +4 more
- 22 May 2016
TL;DR: In this article, the authors present Hawk, a decentralized smart contract system that does not store financial transactions in the clear on the blockchain, thus retaining transactional privacy from the public's view.
2.4K
Universally composable two-party and multi-party secure computation
Ran Canetti,Yehuda Lindell,Rafail Ostrovsky,Amit Sahai +3 more
- 19 May 2002
TL;DR: It is shown how to securely realize any multi-party functionality in a universally composable way, regardless of the number of corrupted participants, which implies that security is preserved under concurrent composition of an unbounded number of protocol executions.
A Framework for Efficient and Composable Oblivious Transfer
Chris Peikert,Vinod Vaikuntanathan,Brent Waters +2 more
- 17 Aug 2008
TL;DR: In this paper, a general framework for constructing oblivious transfer (OT) protocols that are efficient, universally composable, and generally realizable under any one of a variety of standard number-theoretic assumptions, including the decisional Diffie-Hellman assumption, the quadratic residuosity and decisional composite residuosa assumptions, and worst-caselattice assumptions, was proposed.
Town Crier: An Authenticated Data Feed for Smart Contracts
Fan Zhang,Ethan Cecchetti,Kyle Croman,Ari Juels,Elaine Shi +4 more
- 24 Oct 2016
TL;DR: TownCrier as discussed by the authors is an authenticated data feed system that acts as a bridge between smart contracts and existing web sites, which are already commonly trusted for non-blockchain applications, and combines a blockchain front end with a trusted hardware back end to scrape HTTPS-enabled websites and serve source-authenticated data to relying smart contracts.
603
References
•Proceedings Article
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
Oded Goldreich,Silvio Micali,Avi Wigderson +2 more
- 01 Jan 1987
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machimery.
3.9K
How to play ANY mental game
Oded Goldreich,Silvio Micali,Avi Wigderson +2 more
- 01 Jan 1987
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
Universally composable security: a new paradigm for cryptographic protocols
Ran Canetti
- 14 Oct 2001
TL;DR: The notion of universally composable security was introduced in this paper for defining security of cryptographic protocols, which guarantees security even when a secure protocol is composed of an arbitrary set of protocols, or more generally when the protocol is used as a component of a system.
•Proceedings Article
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
Michael Ben-Or,Shafi Goldwasser,Avi Wigderson +2 more
- 01 Jan 1988
TL;DR: The above bounds on t , where t is the number of players in actors, are tight!
2.6K
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Michael Ben-Or,Shafi Goldwasser,Avi Wigderson +2 more
- 01 Jan 1988
TL;DR: In this article, the authors show that every function of n inputs can be efficiently computed by a complete network of n processors in such a way that if no faults occur, no set of size t can be found.
2.4K