Pages that link to "Item:Q2829222"
From MaRDI portal
The following pages link to On the Power of Secure Two-Party Computation (Q2829222):
Displaying 30 items.
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited (Q1675724) (← links)
- Delayed-input cryptographic protocols (Q2011641) (← links)
- Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
- Efficient two-party exponentiation from quotient transfer (Q2096636) (← links)
- On statistical security in two-party computation (Q2119059) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- Fiat–Shamir for Highly Sound Protocols Is Instantiable (Q2827720) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits (Q2912796) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034) (← links)
- Covert two-party computation (Q3581447) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Four-round black-box non-malleable schemes from one-way permutations (Q6114274) (← links)
- Triply adaptive UC NIZK (Q6132421) (← links)
- Steganography-free zero-knowledge (Q6169351) (← links)
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness (Q6169419) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols (Q6660381) (← links)
