Journal of Mathematical Cryptology
Managing Editor: Magliveras, Spyros S. / Steinwandt, Rainer / Trung, Tran
Editorial Board: Blackburn, Simon R. / Blundo, Carlo / Burmester, Mike / Cramer, Ronald / Gilman, Robert / Gonzalez Vasco, Maria Isabel / Grosek, Otokar / Helleseth, Tor / Kim, Kwangjo / Koblitz, Neal / Kurosawa, Kaoru / Lauter, Kristin / Lange, Tanja / Menezes, Alfred / Nguyen, Phong Q. / Pieprzyk, Josef / Rötteler, Martin / Safavi-Naini, Rei / Shparlinski, Igor E. / Stinson, Doug / Takagi, Tsuyoshi / Williams, Hugh C. / Yung, Moti
CiteScore 2018: 1.41
SCImago Journal Rank (SJR) 2018: 0.342
Source Normalized Impact per Paper (SNIP) 2018: 1.076
Mathematical Citation Quotient (MCQ) 2018: 0.75
Polylogarithmic two-round argument systems
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 schemes. But we show the restriction to database-aware PIR schemes is sufficient to overcome these difficulties.
Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.