Pages that link to "Item:Q1334668"
From MaRDI portal
The following pages link to The knowledge complexity of quadratic residuosity languages (Q1334668):
Displaying 11 items.
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- A low communication competitive interactive proof system for promised quadratic residuosity (Q1916029) (← links)
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524) (← links)
- Randomness-efficient non-interactive zero knowledge (Q4572000) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311111) (← links)
- Efficient Non-interactive Range Proof (Q5323058) (← links)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500) (← links)
- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes (Q6064047) (← links)
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages (Q6125215) (← links)