Polylogarithmic two-round argument systems

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 com...

Full description

Bibliographic Details
Main Author: Mie Thilo
Format: Article
Language:English
Published: De Gruyter 2008-12-01
Series:Journal of Mathematical Cryptology
Subjects:
argument system
private information retrieval
spooky interactions
Online Access:https://doi.org/10.1515/JMC.2008.016
id doaj-b039eb5565f44e60bc99af1915a0a887
record_format Article
spelling doaj-b039eb5565f44e60bc99af1915a0a8872021-09-06T19:39:35ZengDe GruyterJournal of Mathematical Cryptology1862-29761862-29842008-12-012434336310.1515/JMC.2008.016Polylogarithmic two-round argument systemsMie Thilo0Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe (TH), Am Fasanengarten 5, D-76131 Karlsruhe, Germany. Email: mie@ira.uka.deWe 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.https://doi.org/10.1515/JMC.2008.016argument systemprivate information retrievalspooky interactions
collection DOAJ
language English
format Article
sources DOAJ
author Mie Thilo
spellingShingle Mie Thilo
Polylogarithmic two-round argument systems
Journal of Mathematical Cryptology
argument system
private information retrieval
spooky interactions
author_facet Mie Thilo
author_sort Mie Thilo
title Polylogarithmic two-round argument systems
title_short Polylogarithmic two-round argument systems
title_full Polylogarithmic two-round argument systems
title_fullStr Polylogarithmic two-round argument systems
title_full_unstemmed Polylogarithmic two-round argument systems
title_sort polylogarithmic two-round argument systems
publisher De Gruyter
series Journal of Mathematical Cryptology
issn 1862-2976
1862-2984
publishDate 2008-12-01
description 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.
topic argument system
private information retrieval
spooky interactions
url https://doi.org/10.1515/JMC.2008.016
work_keys_str_mv AT miethilo polylogarithmictworoundargumentsystems
_version_ 1717770373212143616

Similar Items