Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
From MaRDI portal
Publication:2170001
DOI10.1007/978-3-031-06944-4_9zbMath1497.94081OpenAlexW4285260813MaRDI QIDQ2170001
Jack Doerner, Ran Cohen, Abhi Shelat, Yashvanth Kondi
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_9
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- Secure distributed key generation for discrete-log based cryptosystems
- Fairness versus guaranteed output delivery in secure multiparty computation
- The algebraic group model and its applications
- Securing Abe's mix-net against malicious verifiers via witness indistinguishability
- Player simulation and general adversary structures in perfect multiparty computation
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- TARDIS: a foundation of time-lock puzzles in UC
- Synchronous constructive cryptography
- Revisiting fairness in MPC: polynomial number of parties and general adversarial structures
- Algorand: a secure and efficient distributed ledger
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
- Secure Multi-Party Computation with Identifiable Abort
- Publicly Verifiable Secret Sharing
- On the Classification of Finite Boolean Functions up to Fairness
- Publicly Auditable Secure Multi-Party Computation
- Constant-Size Commitments to Polynomials and Their Applications
- Partial Fairness in Secure Two-Party Computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Complete Fairness in Multi-party Computation without an Honest Majority
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- An O (log n ) expected rounds randomized byzantine generals protocol
- Fair Coin Flipping: Tighter Analysis and the Many-Party Case
- Foundations of Cryptography
- A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
- Universally Composable Synchronous Computation
- 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Advances in Cryptology - EUROCRYPT 2004
- New Techniques for Noninteractive Zero-Knowledge
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- On the Size of Pairing-Based Non-interactive Arguments
- Fair and Robust Multi-party Computation Using a Global Transaction Ledger
- Towards Characterizing Complete Fairness in Secure Two-Party Computation
- From fairness to full security in multiparty computation
- Multiparty generation of an RSA modulus
This page was built for publication: Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
