Pages that link to "Item:Q1382146"
From MaRDI portal
The following pages link to An efficient noninteractive zero-knowledge proof system for NP with general assumptions (Q1382146):
Displaying 8 items.
- Cryptography in the multi-string model (Q744350) (← links)
- Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment (Q857394) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- All-but-many encryption (Q1747665) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- Randomness-efficient non-interactive zero knowledge (Q4572000) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
