scientific article; zbMATH DE number 845842
From MaRDI portal
Publication:4864429
Cited in
(16)- Rate-1 zero-knowledge proofs from one-way functions
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Approximating minimum cuts under insertions
- An Equivalence Between Zero Knowledge and Commitments
- Fast algorithm for recovering the true solution with fixed weight of a system of linear Boolean equations with noised right-hand side
- Computational experience with approximation algorithms for the set covering problem
- The Complexity of Zero Knowledge
- Inapproximability of positive semidefinite permanents and quantum state tomography
- Zero knowledge and the chromatic number
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Quantum advantage from one-way functions
- Unconditionally secure commitments with quantum auxiliary inputs
- On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions
- Counting solutions to polynomial systems via reductions
- Consequences of randomized reductions from SAT to time-bounded Kolmogorov complexity
- Succinct interactive oracle proofs: applications and limitations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864429)
