Copertina

A Survey on the Applications of Zero-Knowledge Proofs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lavin, Ryan, Liu, Xuekai, Mohanty, Hardhik, Norman, Logan, Zaarour, Giovanni, Krishnamachari, Bhaskar
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Cryptography and Security Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Modeling and Analysis of Crypto-Backed Over-Collateralized Stable Derivatives in DeFi
di: Feng, Zhenbang, et al.
Pubblicazione: (2024)

Proactive Market Making and Liquidity Analysis for Everlasting Options in DeFi Ecosystems
di: Mohanty, Hardhik, et al.
Pubblicazione: (2025)

NP-Completeness and Physical Zero-Knowledge Proofs for Zeiger
di: Ruangwises, Suthee
Pubblicazione: (2024)

NP-Completeness and Physical Zero-Knowledge Proof of Hotaru Beam
di: Otsuji, Taisei, et al.
Pubblicazione: (2026)

A Zero-Knowledge PCP Theorem
di: Gur, Tom, et al.
Pubblicazione: (2024)

Efficiently Batching Unambiguous Interactive Proofs
di: Berger, Bonnie, et al.
Pubblicazione: (2025)

Interactive Oracle Proofs of Proximity to Codes on Graphs
di: Delavenne, Hugo, et al.
Pubblicazione: (2025)

Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits
di: Ren, Hanlin, et al.
Pubblicazione: (2025)

Perfect Zero-Knowledge PCPs for #P
di: Gur, Tom, et al.
Pubblicazione: (2024)

Proofs of quantum memory
di: Hhan, Minki, et al.
Pubblicazione: (2025)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
di: Li, Xingjian, et al.
Pubblicazione: (2023)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
di: Grilo, Alex B., et al.
Pubblicazione: (2024)

Pseudorandom Permutations from Random Reversible Circuits
di: He, William, et al.
Pubblicazione: (2024)

Optimally Blending Honeypots into Production Networks: Hardness and Algorithms
di: Zaman, Md Mahabub Uz, et al.
Pubblicazione: (2024)

Quartic quantum speedups for planted inference
di: Schmidhuber, Alexander, et al.
Pubblicazione: (2024)

Vulnerability Abundance: A formal proof of infinite vulnerabilities in code
di: Leverett, Eireann, et al.
Pubblicazione: (2026)

Privacy-preserving formal concept analysis: A homomorphic encryption-based concept construction
di: Chen, Qiangqiang, et al.
Pubblicazione: (2025)

Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices
di: Bhattiprolu, Vijay, et al.
Pubblicazione: (2024)

New constructions of pseudorandom codes
di: Ghentiyala, Surendra, et al.
Pubblicazione: (2024)

Characterizing the Distinguishability of Product Distributions through Multicalibration
di: Marcussen, Cassandra, et al.
Pubblicazione: (2024)

How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions
di: Herman, Tal, et al.
Pubblicazione: (2024)

More Efficient $k$-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities
di: Gretta, Lucas, et al.
Pubblicazione: (2024)

Faster Mixing of Higher-Dimensional Random Reversible Circuits
di: Gay, William, et al.
Pubblicazione: (2024)

Leakage-Resilient Extractors against Number-on-Forehead Protocols
di: Chattopadhyay, Eshan, et al.
Pubblicazione: (2025)

Efficient derandomization of differentially private counting queries
di: Ghentiyala, Surendra
Pubblicazione: (2025)

Hardness Amplification for (Sparse) LPN
di: Aggarwal, Divesh, et al.
Pubblicazione: (2026)

Differentially Private Compression and the Sensitivity of LZ77
di: Blocki, Jeremiah, et al.
Pubblicazione: (2025)

Deterministic Hardness of Approximation of Unique-SVP and GapSVP in $\ell_p$ norms for $p>2$
di: Hecht, Yahli, et al.
Pubblicazione: (2025)

Privacy-Preserving Hamming Distance Computation with Property-Preserving Hashing
di: Zhao, Dongfang
Pubblicazione: (2025)

Unifying computational entropies via Kullback-Leibler divergence
di: Agrawal, Rohit, et al.
Pubblicazione: (2019)

Lattice Based Crypto breaks in a Superposition of Spacetimes
di: Aggarwal, Divesh, et al.
Pubblicazione: (2025)

On the Classical Hardness of the Semidirect Discrete Logarithm Problem in Finite Groups
di: Arif, Mohammad Ferry Husnil, et al.
Pubblicazione: (2025)

Improved Round-by-round Soundness IOPs via Reed-Muller Codes
di: Minzer, Dor, et al.
Pubblicazione: (2025)

Black-Box Crypto is Useless for Pseudorandom Codes
di: Garg, Sanjam, et al.
Pubblicazione: (2025)

Efficient and Privacy-Preserving Binary Dot Product via Multi-Party Computation
di: Dehkordi, Fatemeh Jafarian, et al.
Pubblicazione: (2025)

Zero-Knowledge Proofs in Sublinear Space
di: Nye, Logan
Pubblicazione: (2025)

Who Restores the Peg? A Mean-Field Game Approach to Model Stablecoin Market Dynamics
di: Mohanty, Hardhik, et al.
Pubblicazione: (2026)

Graph-Based DDoS Attack Detection in IoT Systems with Lossy Network
di: Hekmati, Arvin, et al.
Pubblicazione: (2024)

Linear Hashing with $\ell_\infty$ guarantees and two-sided Kakeya bounds
di: Dhar, Manik, et al.
Pubblicazione: (2022)

Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM and k-XOR
di: Dinur, Itai, et al.
Pubblicazione: (2021)