Publicly Verifiable Non-Interactive Zero-Knowledge Proofs

DOI10.1007/3-540-38424-3_26zbMath0800.68414OpenAlexW1538332662MaRDI QIDQ4279587

Adi Shamir, Dror Lapidot

Publication date: 20 September 1994

Published in: Advances in Cryptology-CRYPT0’ 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-38424-3_26

zbMATH Keywords

zero-knowledge proofstrapdoor permutations

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (29)

Concurrent knowledge extraction in public-key models ⋮ Round-optimal fully black-box zero-knowledge arguments from one-way permutations ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ Statistical security in two-party computation revisited ⋮ Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages ⋮ Doubly adaptive zero-knowledge proofs ⋮ Steganography-free zero-knowledge ⋮ The hunting of the SNARK ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Delayed-input cryptographic protocols ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Improved OR-Composition of Sigma-Protocols ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ On the power of secure two-party computation ⋮ Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ On the Power of Secure Two-Party Computation ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ On the Existence of Extractable One-Way Functions ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust

This page was built for publication: Publicly Verifiable Non-Interactive Zero-Knowledge Proofs