Efficient multiparty computations secure against an adaptive adversary
From MaRDI portal
Recommendations
Cited in
(58)- On expected constant-round protocols for Byzantine agreement
- Adaptively secure distributed PRFs from LWE
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Guaranteed output delivery comes free in honest majority MPC
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Asynchronous Byzantine agreement with optimal resilience
- Dynamic threshold secret reconstruction and its application to the threshold cryptography
- Secure multi-party computation made simple
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- scientific article; zbMATH DE number 1676641 (Why is no real title available?)
- On Adaptively Secure Multiparty Computation with a Short CRS
- Secure protocol transformations
- Broadcast (and round) efficient verifiable secret sharing
- Adaptively secure non-interactive threshold cryptosystems
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Efficient secure multiparty computation with identifiable abort
- Secure Protocols with Asymmetric Trust
- MPC vs. SFE : Unconditional and Computational Security
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 503347 (Why is no real title available?)
- Applied Cryptography and Network Security
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Efficient Simultaneous Broadcast
- A Single Initialization Server for Multi-party Cryptography
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- One-Sided Adaptively Secure Two-Party Computation
- On the exact round complexity of secure three-party computation
- Adaptively secure MPC with sublinear communication complexity
- Computations with a deck of cards
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Must the communication graph of MPC protocols be an expander?
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- Perfect MPC over layered graphs
- The round complexity of statistical MPC with optimal resiliency
- Lightweight noninteractive membership authentication and group key establishment for WSNs
- Network agnostic MPC with statistical security
- Perfect (parallel) broadcast in constant expected rounds via statistical VSS
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Efficient distributed randomness generation from minimal assumptions where \underline{PA}rties \underline{S}peak \underline{S}equentially \underline{O}nce
- Statistical layered MPC
- Honest majority GOD MPC with \(O(\operatorname{depth}(C))\) rounds and low online communication
- HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
- Rumors MPC: GOD for dynamic committees, low communication via constant-round chat
- Information-theoretic network-agnostic MPC with polynomial communication
- Round-optimal Byzantine agreement without trusted setup
- Maintaining sublinear locality over time: adaptively secure MPC on a reusable hidden graph
- Detect, pack and batch: perfectly secure MPC with linear communication and constant expected time
This page was built for publication: Efficient multiparty computations secure against an adaptive adversary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250770)
