scientific article; zbMATH DE number 845842
From MaRDI portal
Publication:4864429
zbMATH Open0850.68165MaRDI QIDQ4864429FDOQ4864429
Authors:
Publication date: 18 February 1996
Title of this publication is not available (Why is that?)
Cited In (14)
- 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
- The Complexity of Zero Knowledge
- Computational experience with approximation algorithms for the set covering problem
- Inapproximability of positive semidefinite permanents and quantum state tomography
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Zero knowledge and the chromatic number
- Quantum advantage from one-way functions
- Unconditionally secure commitments with quantum auxiliary inputs
- Counting solutions to polynomial systems via reductions
- On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions
- 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)
