Pages that link to "Item:Q5451037"
From MaRDI portal
The following pages link to Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator (Q5451037):
Displayed 42 items.
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- One-way functions imply secure computation in a quantum world (Q2120090) (← links)
- Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback (Q2695652) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
- Round-Optimal Black-Box Two-Party Computation (Q3457073) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← links)
- Succinct arguments for RAM programs via projection codes (Q6145783) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Quadratic multiparty randomized encodings beyond honest majority and their applications (Q6166962) (← links)
- Reputation at stake! A trust layer over decentralized ledger for multiparty computation and reputation-fair lottery (Q6176062) (← links)
- Perfect MPC over layered graphs (Q6186597) (← links)