What Security Can We Achieve Within 4 Rounds?

DOI10.1007/978-3-319-44618-9_26zbMath1435.94130OpenAlexW2398239478MaRDI QIDQ2827735

Muthuramakrishnan Venkitasubramaniam, Carmit Hazay

Publication date: 21 October 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_26

zbMATH Keywords

oblivious transferround complexitysecure computationcoin-tossing

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Security-preserving distributed samplers: how to generate any CRS in one round without random oracles

Cites Work

• Smooth projective hashing and two-message oblivious transfer
• Security against covert adversaries: Efficient protocols for realistic adversaries
• How Fair is Your Protocol?
• How to Use Bitcoin to Design Fair Protocols
• Efficient Non-interactive Secure Computation
• Black-Box Constructions of Protocols for Secure Computation
• Round-Optimal Black-Box Two-Party Computation
• Partial Fairness in Secure Two-Party Computation
• New notions of security
• A Framework for Efficient and Composable Oblivious Transfer
• An Optimally Fair Coin Toss
• Optimistic fair exchange of digital signatures
• On the Composition of Zero-Knowledge Proof Systems
• Advances in Cryptology – CRYPTO 2004
• The Exact Round Complexity of Secure Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: What Security Can We Achieve Within 4 Rounds?