Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
From MaRDI portal
Publication:5451037
DOI10.1007/11535218_23zbMATH Open1145.94437OpenAlexW1526979127MaRDI QIDQ5451037FDOQ5451037
Authors: Yuval Ishai, Ivan B. Damgård 
Publication date: 17 March 2008
Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11535218_23
Recommendations
Cited In (46)
- Efficient constant-round multi-party computation combining BMR and SPDZ
- One-way functions imply secure computation in a quantum world
- Succinct arguments for RAM programs via projection codes
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- On actively-secure elementary MPC reductions
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Probabilistic termination and composability of cryptographic protocols
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Round-optimal secure multi-party computation
- Perfect secure computation in two rounds
- Best possible information-theoretic MPC
- Perfect secure computation in two rounds
- Fluid MPC: secure multiparty computation with dynamic participants
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- Round-optimal black-box two-party computation
- Fast pseudorandom functions based on expander graphs
- Binary AMD circuits from secure multiparty computation
- On the round complexity of black-box secure MPC
- Reputation at stake! A trust layer over decentralized ledger for multiparty computation and reputation-fair lottery
- Round-optimal black-box protocol compilers
- Perfect MPC over layered graphs
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Constant-round black-box construction of composable multi-party computation protocol
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Distributed protocols for oblivious transfer and polynomial evaluation
- On expected constant-round protocols for Byzantine agreement
- Secure multiparty computation with free branching
- Title not available (Why is that?)
- Topology-hiding computation for networks with unknown delays
- Black-box transformations from passive to covert security with public verifiability
- Efficient constant-round MPC with identifiable abort and public verifiability
- Probabilistic Termination and Composability of Cryptographic Protocols
- Adaptively secure MPC with sublinear communication complexity
- On Adaptively Secure Multiparty Computation with a Short CRS
- Must the communication graph of MPC protocols be an expander?
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Constant-round asynchronous multi-party computation based on one-way functions
- Secure computation with low communication from cross-checking
- Efficient one-sided adaptively secure computation
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- MPC with friends and foes
- Actively secure garbled circuits with constant communication overhead in the plain model
- Round-efficient black-box construction of composable multi-party computation
This page was built for publication: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451037)
