Polylogarithmic two-round argument systems

Journal of Mathematical Cryptology

Mie Thilo¹ 

[1] Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe (TH), Am Fasanengarten 5, D-76131 Karlsruhe, Germany. Email: [e-mail];

关键词: argument system;    private information retrieval;    spooky interactions;   

DOI  :  10.1515/JMC.2008.016

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown