New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
type: Item
instance of: scholarly article
title: New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
zbMATH Open document ID: 1504.94099
DOI: 10.1007/978-3-030-56877-1_24
author: Marshall Ball
author: Dana Dachman-Soled
author: Mukul Kulkarni
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7627838
zbMATH Keywords: Nisan-Wigderson designs
MaRDI profile type: Publication
full work available at URL: 978-3-030-56877-1 24
OpenAlex ID: W3048880789
cites work: Fully homomorphic NIZK and NIWI proofs
cites work: Cryptography in constant parallel time
cites work: On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
cites work: Average-case fine-grained hardness
cites work: Proofs of Work from worst-case assumptions
cites work: Derandomization in Cryptography
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Theory of Cryptography
cites work: On arithmetic branching programs
cites work: NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
cites work: Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
cites work: Trading help for interaction in statistical zero-knowledge proofs
cites work: Computational Integrity with a Public Random String from Quasi-Linear PCPs
cites work: Scalable zero knowledge with no trusted setup
cites work: One-message zero knowledge and non-malleable commitments
cites work: On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
cites work: Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III
cites work: Fine-grained secure computation
cites work: Theory of cryptography. Fifth theory of cryptography conference, TCC 2008, New York, USA, March 19--21, 2008. Proceedings
cites work: Fiat-Shamir: from practice to theory
cites work: Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
cites work: Fine-Grained Cryptography
cites work: Precise Time and Space Simulatable Zero-Knowledge
cites work: Zaps and Their Applications
cites work: Fine-grained cryptography revisited
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: Q3210166
cites work: Foundations of Cryptography
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: Definitions and properties of zero-knowledge proof systems
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Simultaneous amplification: the case of non-interactive zero-knowledge
cites work: Non-interactive Zaps and New Techniques for NIZK
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: Efficient Non-interactive Proof Systems for Bilinear Groups
cites work: Q5750403
cites work: Q4737161
cites work: Q4940696
cites work: Distinguisher-dependent simulation in two rounds and its applications
cites work: Statistical witness indistinguishability (and more) in two messages
cites work: Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
cites work: Multi-theorem preprocessing NIZKs from lattices
cites work: Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
cites work: Public-key cryptography in the fine-grained setting
cites work: Local zero knowledge
cites work: An Equivalence Between Zero Knowledge and Commitments
cites work: Q4864429
cites work: Unconditional Characterizations of Non-interactive Zero-Knowledge
cites work: Noninteractive zero knowledge for NP from (Plain) Learning With Errors
cites work: Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part III
cites work: Constant Depth Reducibility
Recommended article: Efficient Zero-Knowledge Proofs
Recommended article: Zero knowledge with efficient provers
Recommended article: New Techniques for Noninteractive Zero-Knowledge
Recommended article: Q4373608
Recommended article: A new approach to efficient non-malleable zero-knowledge
Recommended article: Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)
Recommended article: How to Utilize the Randomness of Zero-Knowledge Proofs
Recommended article: Zero-Knowledge Proofs from Secure Multiparty Computation
Recommended article: Q3987506
Recommended article: Non-interactive zero-knowledge proofs with fine-grained security
description: scientific article; zbMATH DE number 7627838