New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
From MaRDI portal
Publication:2104237
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
Cites work
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- scientific article; zbMATH DE number 845842 (Why is no real title available?)
- scientific article; zbMATH DE number 1406780 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part III
- Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III
- An Equivalence Between Zero Knowledge and Commitments
- Average-case fine-grained hardness
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Computational integrity with a public random string from quasi-linear PCPs
- Constant Depth Reducibility
- Cryptography in constant parallel time
- Definitions and properties of zero-knowledge proof systems
- Derandomization in Cryptography
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Distinguisher-dependent simulation in two rounds and its applications
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fiat-Shamir: from practice to theory
- Fine-Grained Cryptography
- Fine-grained cryptography revisited
- Fine-grained secure computation
- Foundations of Cryptography
- Fully homomorphic NIZK and NIWI proofs
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- Local zero knowledge
- Multi-theorem preprocessing NIZKs from lattices
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- New techniques for noninteractive zero-knowledge
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Non-interactive Zaps and New Techniques for NIZK
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On arithmetic branching programs
- On non-black-box simulation and the impossibility of approximate obfuscation
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- One-message zero knowledge and non-malleable commitments
- Precise time and space simulatable zero-knowledge
- Proofs of Work from worst-case assumptions
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Public-key cryptography in the fine-grained setting
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Scalable zero knowledge with no trusted setup
- Simultaneous amplification: the case of non-interactive zero-knowledge
- Statistical witness indistinguishability (and more) in two messages
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Theory of cryptography. Fifth theory of cryptography conference, TCC 2008, New York, USA, March 19--21, 2008. Proceedings
- Trading help for interaction in statistical zero-knowledge proofs
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Zaps and Their Applications
Cited in
(11)- Non-interactive zero-knowledge proofs with fine-grained security
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Fine-grained cryptography revisited
- scientific article; zbMATH DE number 1955784 (Why is no real title available?)
- Fine-grained polynomial functional encryption
- Unconditionally secure NIZK in the fine-grained setting
- Leakage-resilient circuits against \textsf{NC1}, revisited
- Fine-grained non-interactive key-exchange without idealized assumptions
- (Inefficient prover) ZAPs from hard-to-invert functions
- Fine-grained secure attribute-based encryption
- Fine-grained secure attribute-based encryption
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)
