Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation

zbMath0861.94013MaRDI QIDQ1924194

Mihir Bellare, Mordechai M. Yung

Publication date: 19 May 1997

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

zbMATH Keywords

cryptographic protocolscertificationtrapdoor permutationsnoninteractive zero-knowledge (NIZK) proofs

Mathematics Subject Classification ID

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

Related Items (20)

Certifying trapdoor permutations, revisited ⋮ Mercurial commitments with applications to zero-knowledge sets ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Enhancements of trapdoor permutations ⋮ Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ A Brief History of Provably-Secure Public-Key Encryption ⋮ Existence of 3-round zero-knowledge proof systems for NP ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Zero-Knowledge Proofs of Proximity ⋮ An Exponential Separation Between MA and AM Proofs of Proximity ⋮ An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity ⋮ Optimal security proofs for full domain hash. Revisited ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Efficient Sequential Aggregate Signed Data ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust

This page was built for publication: Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation