Pages that link to "Item:Q2829222"
From MaRDI portal
The following pages link to On the Power of Secure Two-Party Computation (Q2829222):
Displaying 16 items.
- 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)
- Delayed-input cryptographic protocols (Q2011641) (← links)
- Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← 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)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← 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)
