An efficient noninteractive zero-knowledge proof system for NP with general assumptions

DOI10.1007/s001459900032zbMath1019.94014OpenAlexW2055863940WikidataQ127011559 ScholiaQ127011559MaRDI QIDQ1382146

Joe Kilian, Erez Petrank

Publication date: 14 September 2003

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001459900032

zbMATH Keywords

interactive proof systemscircuit satisfiabilityefficient proofshidden bit modelnoninteractive zero-knowledge proofsone-way permutationsshared random string model

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62)

Related Items

Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment ⋮ Randomness-efficient non-interactive zero knowledge ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ All-but-many encryption ⋮ Perfect Non-interactive Zero Knowledge for NP ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Cryptography in the multi-string model ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings