New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust

DOI10.1007/978-3-030-56877-1_24zbMATH Open1504.94099OpenAlexW3048880789MaRDI QIDQ2104237FDOQ2104237

Mukul Kulkarni, Marshall Ball, Dana Dachman-Soled

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_24

Recommendations

• Efficient zero-knowledge proofs. (Abstract)
• Zero knowledge with efficient provers
• New techniques for noninteractive zero-knowledge
• scientific article; zbMATH DE number 1107670
• A new approach to efficient non-malleable zero-knowledge
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• How to Utilize the Randomness of Zero-Knowledge Proofs
• Zero-knowledge proofs from secure multiparty computation
• scientific article; zbMATH DE number 31277
• Non-interactive zero-knowledge proofs with fine-grained security

zbMATH Keywords

Nisan-Wigderson designs

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Cryptography in constant parallel time
• Title not available (Why is that?)
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Foundations of Cryptography
• Title not available (Why is that?)
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Definitions and properties of zero-knowledge proof systems
• The Knowledge Complexity of Interactive Proof Systems
• Derandomization in Cryptography
• Zaps and Their Applications
• Non-interactive Zaps and New Techniques for NIZK
• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Unconditional Characterizations of Non-interactive Zero-Knowledge
• Title not available (Why is that?)
• An Equivalence Between Zero Knowledge and Commitments
• On arithmetic branching programs
• Local zero knowledge
• Constant Depth Reducibility
• Advances in Cryptology - CRYPTO 2003
• Fine-grained cryptography revisited
• On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
• New Techniques for Noninteractive Zero-Knowledge
• Theory of Cryptography
• On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Scalable zero knowledge with no trusted setup
• NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trading help for interaction in statistical zero-knowledge proofs
• One-message zero knowledge and non-malleable commitments
• Fine-grained secure computation
• Statistical witness indistinguishability (and more) in two messages
• Distinguisher-dependent simulation in two rounds and its applications
• Fine-Grained Cryptography
• Average-case fine-grained hardness
• Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III
• Proofs of Work from worst-case assumptions
• Fully homomorphic NIZK and NIWI proofs
• Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
• Fiat-Shamir: from practice to theory
• Computational Integrity with a Public Random String from Quasi-Linear PCPs
• Multi-theorem preprocessing NIZKs from lattices
• Simultaneous amplification: the case of non-interactive zero-knowledge
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• Public-key cryptography in the fine-grained setting
• Theory of cryptography. Fifth theory of cryptography conference, TCC 2008, New York, USA, March 19--21, 2008. Proceedings
• Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part III
• Precise Time and Space Simulatable Zero-Knowledge
• Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model

Cited In (9)

• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• Fine-grained cryptography revisited
• Title not available (Why is that?)
• Fine-grained polynomial functional encryption
• Unconditionally secure NIZK in the fine-grained setting
• Fine-grained non-interactive key-exchange without idealized assumptions
• Fine-grained secure attribute-based encryption
• Fine-grained secure attribute-based encryption
• Non-interactive zero-knowledge proofs with fine-grained security

This page was built for publication: New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust

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