Pages that link to "Item:Q2953816"
From MaRDI portal
The following pages link to Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) (Q2953816):
Displaying 12 items.
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
- Encryption Switching Protocols (Q2835592) (← links)
- On zero-knowledge proofs (extended abstract) (Q3191992) (← links)
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs (Q3600238) (← links)
- (Q4414289) (← links)
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications (Q5087262) (← links)
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings (Q5097051) (← links)
- Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting (Q5402970) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)