What security can we achieve within 4 rounds?
From MaRDI portal
Publication:2010586
DOI10.1007/s00145-019-09323-1zbMath1436.94071OpenAlexW2945043960MaRDI QIDQ2010586
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
Publication date: 27 November 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-019-09323-1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A new approach to round-optimal secure multiparty computation
- Four round secure computation without setup
- Round-optimal secure two-party computation from trapdoor permutations
- Round optimal concurrent MPC via strong simulation
- Fast distributed RSA key generation for semi-honest and malicious adversaries
- Promise zero knowledge and its applications to round optimal MPC
- Security and composition of multiparty cryptographic protocols
- Security against covert adversaries: Efficient protocols for realistic adversaries
- How Fair is Your Protocol?
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
- How to Use Bitcoin to Design Fair Protocols
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- A “Paradoxical” Solution to The Signature Problem
- Semi-homomorphic Encryption and Multiparty Computation
- Efficient Non-interactive Secure Computation
- Black-Box Constructions of Protocols for Secure Computation
- How to share a secret
- Round-Optimal Black-Box Two-Party Computation
- Partial Fairness in Secure Two-Party Computation
- Zero-Knowledge Proofs from Secure Multiparty Computation
- New notions of security
- A Framework for Efficient and Composable Oblivious Transfer
- An Optimally Fair Coin Toss
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Foundations of Cryptography
- A public key cryptosystem and a signature scheme based on discrete logarithms
- On the Composition of Zero-Knowledge Proof Systems
- From Weak to Strong Zero-Knowledge and Applications
- Advances in Cryptology – CRYPTO 2004
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- The Exact Round Complexity of Secure Computation
- Round-optimal secure multi-party computation
- Low cost constant round MPC combining BMR and oblivious transfer
This page was built for publication: What security can we achieve within 4 rounds?
