Guaranteed output in O(n) rounds for round-robin sampling protocols
From MaRDI portal
Publication:7021184
Cites work
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
- A full characterization of functions that imply fair coin tossing and ramifications to fairness
- A Sender Verifiable Mix-Net and a New Proof of a Shuffle
- Adaptively secure MPC with sublinear communication complexity
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Algorand: a secure and efficient distributed ledger
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- An O (log n ) expected rounds randomized byzantine generals protocol
- An almost-optimally fair three-party coin-flipping protocol
- An optimally fair coin toss
- Catching MPC cheaters: identification and openability
- Cheater detection in SPDZ multiparty computation
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete Fairness in Multi-party Computation without an Honest Majority
- Complete fairness in secure two-party computation
- Constant-Size Commitments to Polynomials and Their Applications
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Efficient constant-round MPC with identifiable abort and public verifiability
- Efficient generation of shared RSA keys
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficient secure multiparty computation with identifiable abort
- Fair and robust multi-party computation using a global transaction ledger
- Fair coin flipping: tighter analysis and the many-party case
- Fairness versus guaranteed output delivery in secure multiparty computation
- Fast distributed RSA key generation for semi-honest and malicious adversaries
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- From fairness to full security in multiparty computation
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- scientific article; zbMATH DE number 1618057 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 1304079 (Why is no real title available?)
- scientific article; zbMATH DE number 1962164 (Why is no real title available?)
- scientific article; zbMATH DE number 1504554 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Multiparty generation of an RSA modulus
- New techniques for noninteractive zero-knowledge
- On the classification of finite Boolean functions up to fairness
- On the size of pairing-based non-interactive arguments
- Partial fairness in secure two-party computation
- Player simulation and general adversary structures in perfect multiparty computation
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Protocols for multiparty coin toss with a dishonest majority
- Publicly auditable secure multi-party computation
- Publicly verifiable secret sharing
- Revisiting fairness in MPC: polynomial number of parties and general adversarial structures
- Secure multi-party computation with identifiable abort
- Securing Abe's mix-net against malicious verifiers via witness indistinguishability
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Snarky ceremonies
- Synchronous constructive cryptography
- TARDIS: a foundation of time-lock puzzles in UC
- The algebraic group model and its applications
- Towards characterizing complete fairness in secure two-party computation
- Universally composable security
- Universally composable synchronous computation
- Universally composable two-party and multi-party secure computation
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Updatable and universal common reference strings with applications to zk-SNARKs
This page was built for publication: Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021184)
