Pages that link to "Item:Q3457072"
From MaRDI portal
The following pages link to Efficient Constant Round Multi-party Computation Combining BMR and SPDZ (Q3457072):
Displaying 26 items.
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation (Q1687724) (← links)
- On multiparty garbling of arithmetic circuits (Q1710662) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Block cipher invariants as eigenvectors of correlation matrices (Q5915627) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
