Computationally private information retrieval with polylogarithmic communication

DMCA

Computationally private information retrieval with polylogarithmic communication (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Christian Cachin , Silvio Micali , Markus Stadler

Venue:	Advances in Cryptology—EUROCRYPT ’99
Citations:	254 - 2 self

BibTeX

@INPROCEEDINGS{Cachin99computationallyprivate,
    author = {Christian Cachin and Silvio Micali and Markus Stadler},
    title = {Computationally private information retrieval with polylogarithmic communication},
    booktitle = {Advances in Cryptology—EUROCRYPT ’99},
    year = {1999},
    pages = {402--414},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable intractability assumption, which we call the Φ-Hiding Assumption (ΦHA): essentially the difficulty of deciding whether a small prime> 2 divides ϕ(m), where m is a composite integer of unknown factorization. Our result also implies the existence of two-round CS proof systems under a concrete complexity assumption. Keywords: Integer factorization, Euler’s function, Φ-hiding assumption, private information retrieval, computationally sound proofs.

Keyphrases

private information retrieval polylogarithmic communication unknown factorization sound proof two-round c proof system hiding assumption composite integer euler function integer factorization private information retrieval scheme polylogarithmic communication complexity reasonable intractability assumption small prime concrete complexity assumption

DMCA