Publicly Verifiable Non-Interactive Zero-Knowledge Proofs

DOI10.1007/3-540-38424-3_26MaRDI QIDQ4279587zbMATH OpenOpenAlexFDO

Authors Dror Lapidot, Adi Shamir

Publication date 20 September 1994

Published in Advances in Cryptology - CRYPTO '90. A conference on the theory and application of Cryptography, Univ. of California, Santa Barbara, USA, August 11--15, 1990. Proceedings (Search for Journal in Brave)

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

zbMATH Keywords

trapdoor permutationszero-knowledge proofs

Mathematics Subject Classification ID

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

Recommendations

• Noninteractive Zero-Knowledge
• scientific article; zbMATH DE number 4053065
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions

Cited in

(41)

• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• Fiat-Shamir for highly sound protocols is instantiable
• The hunting of the SNARK
• Delayed-input cryptographic protocols
• Compact designated verifier NIZKs from the CDH assumption without pairings
• Publicly verifiable zero knowledge from (collapsing) blockchains
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• Publicly verifiable proofs from blockchains
• On the power of secure two-party computation
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Concurrent knowledge extraction in public-key models
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Improved OR-composition of sigma-protocols
• 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
• On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
• Indistinguishable proofs of work or knowledge
• Short non-interactive zero-knowledge proofs
• 3-message zero knowledge against human ignorance
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
• Noninteractive Zero-Knowledge
• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• Robust transforming combiners from indistinguishability obfuscation to functional encryption
• On the exact round complexity of self-composable two-party computation
• \(k\)-critical graphs in \(P_5\)-free graphs
• Multi-theorem preprocessing NIZKs from lattices
• 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
• Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
• Short paper: naysayer proofs
• Improved universal thresholdizer from iterative Shamir secret sharing
• Almost-total puzzles and their applications
• Four-round statistical non-malleable zero-knowledge
• Non-interactive zero-knowledge proofs for composite statements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4279587)