Pages that link to "Item:Q2817650"
From MaRDI portal
The following pages link to A minimal model for secure computation (extended abstract) (Q2817650):
Displaying 18 items.
- Ad Hoc PSM Protocols: Secure Computation Without Coordination (Q5270377) (← links)
- Theory of Cryptography (Q5901775) (← links)
- The communication complexity of private simultaneous messages, revisited (Q5918864) (← links)
- Private simultaneous messages based on quadratic residues (Q6070349) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Secure non-interactive reducibility is decidable (Q6169412) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← links)
- On secure computation of solitary output functionalities with and without broadcast (Q6582168) (← links)
- Improved polynomial secret-sharing schemes (Q6582181) (← links)
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity (Q6595687) (← links)
- Secure function extensions to additively homomorphic cryptosystems (Q6620058) (← links)
- Explicit lower bounds for communication complexity of PSM for concrete functions (Q6623345) (← links)
- Can Alice and Bob guarantee output to Carol? (Q6637537) (← links)
- Garbled circuit lookup tables with logarithmic number of ciphertexts (Q6637543) (← links)
