Practical UC security with a Global Random Oracle
Ran Canetti,Abhishek Jain,Alessandra Scafuro +2 more
- pp 597-608
Reads0
Chats0
TLDR
This work shows that there exist commitment, zero-knowledge and general function evaluation protocols with universally composable security, in a model where all parties and all protocols have access to a single, global, random oracle and no other trusted setup.Abstract:
Contrary to prior belief, we show that there exist commitment, zero-knowledge and general function evaluation protocols with universally composable security, in a model where all parties and all protocols have access to a single, global, random oracle and no other trusted setup. This model provides significantly stronger composable security guarantees than the traditional random oracle model of Bellare and Rogaway [CCS'93] or even the common reference string model. Indeed, these latter models provide no security guarantees in the presence of arbitrary protocols that use the {\em same} random oracle (or reference string or hash function). Furthermore, our protocols are highly efficient. Specifically, in the interactive setting, our commitment and general computation protocols are much more efficient than the best known ones due to Lindell [Crypto'11,'13] which are secure in the common reference string model. In the non-interactive setting, our protocols are slightly less efficient than the best known ones presented by Afshar et al. [Eurocrypt '14] but do away with the need to rely on a non-global (programmable) reference string.read more
Citations
More filters
Proceedings ArticleDOI
Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability
TL;DR: A novel Proof-of-Stake protocol, Ouroboros Genesis, that enables parties to safely join (or rejoin) the protocol execution using only the genesis block information, and proves the security of the construction against an adaptive adversary.
Proceedings ArticleDOI
The Ring of Gyges: Investigating the Future of Criminal Smart Contracts
TL;DR: In this article, the authors explore the risk of smart contracts fueling new criminal ecosystems and show how what they call criminal smart contracts (CSCs) can facilitate leakage of confidential information, theft of cryptographic keys, and various real-world crimes (murder, arson, terrorism).
Proceedings ArticleDOI
FairSwap: How To Fairly Exchange Digital Goods
TL;DR: FairSwap is introduced -- an efficient protocol for fair exchange of digital goods using smart contracts executed over decentralized cryptocurrencies, where the contract takes the role of an external judge that completes the exchange in case of disagreement.
Posted Content
The Ring of Gyges: Investigating the Future of Criminal Smart Contracts.
TL;DR: In this paper, the authors explore the risk of smart contracts fueling new criminal ecosystems and show how what they call criminal smart contracts (CSCs) can facilitate leakage of confidential information, theft of cryptographic keys, and various realworld crimes (murder, arson, terrorism).
Book ChapterDOI
Fair and Robust Multi-party Computation Using a Global Transaction Ledger
TL;DR: In this paper, the authors propose a secure MPC protocol with compensation, which is based on the idea that when the protocol aborts in an unfair manner, after the adversary receives output then honest parties get compensated by the adversarially controlled parties.
References
More filters
Proceedings ArticleDOI
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
Proceedings ArticleDOI
How to generate and exchange secrets
TL;DR: A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature.
Proceedings ArticleDOI
Universally composable security: a new paradigm for cryptographic protocols
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.
Journal ArticleDOI
Efficient signature generation by smart cards
TL;DR: An efficient algorithm that preprocesses the exponentiation of a random residue modulo p is presented, which improves the ElGamal signature scheme in the speed of the procedures for the generation and the verification of signatures and also in the bit length of signatures.
Book ChapterDOI
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
TL;DR: It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons.