Pages that link to "Item:Q3575162"
From MaRDI portal
The following pages link to Zero-Knowledge Proofs from Secure Multiparty Computation (Q3575162):
Displaying 24 items.
- On the amortized complexity of zero-knowledge protocols (Q744603) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Secure multi-party quantum computation with a dishonest majority (Q2055679) (← links)
- Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
- An intermediate secret-guessing attack on hash-based signatures (Q2128758) (← links)
- ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- LegRoast: Efficient Post-quantum Signatures from the Legendre PRF (Q5041218) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
