Pages that link to "Item:Q1653085"
From MaRDI portal
The following pages link to Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge (Q1653085):
Displaying 17 items.
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- FHE-based bootstrapping of designated-prover NIZK (Q2055742) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- New constructions of reusable designated-verifier NIZKs (Q2304937) (← links)
- (Q2987990) (← links)
- Universal Accumulators with Efficient Nonmembership Proofs (Q3612386) (← links)
- (Q4279688) (← links)
- Round-Efficient Anonymous Password-Authenticated Key Exchange Protocol in the Standard Model (Q5040423) (← links)
- Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting (Q5402970) (← links)
- Cryptography and Coding (Q5897518) (← links)
- Theory of Cryptography (Q5901774) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Zero-knowledge arguments for subverted RSA groups (Q6088994) (← links)
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups (Q6110377) (← links)
- Efficient NIZKs for algebraic sets (Q6157547) (← links)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
