Information-Theoretic Private Information Retrieval: A Unified Construction (Extended Abstract)

Information-Theoretic Private Information Retrieval: A Unified Construction (Extended Abstract) (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Amos Beimel , Yuval Ishai

Venue:	Proc. of the 28th International Colloquium on Automata, Languages and Programming, volume 2076 of Lecture Notes in Computer Science
Citations:	39 - 5 self

BibTeX

@INPROCEEDINGS{Beimel01information-theoreticprivate,
    author = {Amos Beimel and Yuval Ishai},
    title = {Information-Theoretic Private Information Retrieval: A Unified Construction (Extended Abstract)},
    booktitle = {Proc. of the 28th International Colloquium on Automata, Languages and Programming, volume 2076 of Lecture Notes in Computer Science},
    year = {2001},
    pages = {912--926},
    publisher = {Springer}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Amos Beimel and Yuval Ishai Ben-Gurion University, Israel. beimel@cs.bgu.ac.il.

Citations

1404	How to share a secret - Shamir - 1979
347	Private information retrieval - Chor, Goldreich, et al. - 1998
187	Computationally private information retrieval with polylogarithmic communication - Cachin, Micali, et al. - 1999
149	Hiding instances in multi-oracle queries - Beaver, Feigenbaum - 1990
122	Generalized secret sharing and monotone functions - Benaloh, Leichter - 1989
98	Secret sharing scheme realizing general access structure - Ito, Saito, et al. - 1987
96	Protecting data privacy in private information retrieval schemes - Gertner, Ishai, et al. - 2000
92	On the efficiency of local decoding procedures for error-correcting codes - Katz, Trevisan - 2000
83	Upper bound on communication complexity of private information retrieval - Ambainis - 1997
55	Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions - Alon, Naor - 1994
38	Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing - Beimel, Ishai, et al.
32	Locally random reductions: Improvements and applications - Beaver, Feigenbaum, et al. - 1997
27	Simultaneous messages vs. communication - Babai, Kimmel, et al.
23	Explicit construction of exponential sized families of k-independent sets - Alon - 1986
11	Universal service-providers for private information retrieval - Di-Crescenzo, Ishai, et al.
10	Improved upper bounds on information theoretic private information retrieval - Ishai, Kushilevitz - 1999
1	Some recusrive constructions for perfect hash families - Atici, Magliveras, et al. - 1996
1	Improved upper boundson the simultaneous messagescomplexity of the generalized addressing function - Ambainis, Lokam
1	On the length of linear error-correcting codeshaving a 2-query local decoding procedure - Goldreich, Trevisan - 2000
1	Replication is not needed:Single database,computationallyprivate information retrieval - Ostrovsky - 1997
1	Private accessto distributed information - Mann - 1998