Polylogarithmic two-round argument systems

@article{Mie2008PolylogarithmicTA,
  title={Polylogarithmic two-round argument systems},
  author={Thilo Mie},
  journal={J. Mathematical Cryptology},
  year={2008},
  volume={2},
  pages={343-363}
}
We present a two-round argument system for NP languages with polylogarithmic communication complexity. We introduce a novel property of private information retrieval (PIR) schemes, that we call database-awareness. We construct a concrete database-aware PIR scheme and build our argument system by combining a database-aware PIR scheme with a probabilistically checkable proof system (PCP). Dwork et.al. (2004) pointed out difficulties to prove the soundness of such constructions for arbitrary PIR… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 26 REFERENCES

Pohlig and Martin Hellman , An improved algorithm for computing logarithms over GF ( p ) and its cryptographic significance

  • C. Stephen
  • Advances in Cryptology – CRYPTO ’ 03 , Lecture…
  • 2003

Vadhan , and Avi Wigderson , On interactive proofs with a laconic prover

  • Oded Goldreich, P. Salil
  • Computational Complexity
  • 2002

Similar Papers

Loading similar papers…