Efficient constant round multi-party computation combining BMR and SPDZ
From MaRDI portal
(Redirected from Publication:3457072)
Recommendations
- Efficient constant-round multi-party computation combining BMR and SPDZ
- More efficient constant-round multi-party computation from BMR and SHE
- Efficient scalable constant-round MPC via garbled circuits
- Low cost constant round MPC combining BMR and oblivious transfer
- Low cost constant round MPC combining BMR and oblivious transfer
Cited in
(43)- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- An efficient structural attack on NIST submission DAGS
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- Efficient scalable constant-round MPC via garbled circuits
- On multiparty garbling of arithmetic circuits
- Secure computation with low communication from cross-checking
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Topology-hiding computation for networks with unknown delays
- Going beyond dual execution: MPC for functions with efficient verification
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- Efficient constant-round MPC with identifiable abort and public verifiability
- The price of active security in cryptographic protocols
- Broadcast-optimal two-round MPC
- Full-threshold actively-secure multiparty arithmetic circuit garbling
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- Concrete efficiency improvements for multiparty garbling with an honest majority
- Probabilistic termination and composability of cryptographic protocols
- Efficient constant-round multi-party computation combining BMR and SPDZ
- Better preprocessing for secure multiparty computation
- Network oblivious transfer
- Probabilistic Termination and Composability of Cryptographic Protocols
- More efficient constant-round multi-party computation from BMR and SHE
- Constant rounds almost linear complexity multi-party computation for prefix sum
- Scalable multi-party private set-intersection
- Block cipher invariants as eigenvectors of correlation matrices
- Round-optimal secure multi-party computation
- TinyKeys: a new approach to efficient multi-party computation
- Low cost constant round MPC combining BMR and oblivious transfer
- Low cost constant round MPC combining BMR and oblivious transfer
- Actively secure half-gates with minimum overhead under duplex networks
- Actively secure garbled circuits with constant communication overhead in the plain model
- MPClan: protocol suite for privacy-conscious computations
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- The price of active security in cryptographic protocols
- Fast public-key silent OT and more from constrained Naor-Reingold
- Rerandomizable garbling, revisited
- Multiparty garbling from OT with linear scaling and RAM support
- Towards building scalable constant-round MPC from minimal assumptions via round collapsing
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Dishonest majority constant-round MPC with linear communication from DDH
- Actively secure half-gates with minimum overhead under duplex networks
- Honest majority constant-round MPC with linear communication from one-way functions
This page was built for publication: Efficient constant round multi-party computation combining BMR and SPDZ
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457072)
