A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 222-239
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Local Correctability of Expander CodesLecture Notes in Computer Science, 2013
- Locally Decodable CodesFoundations and Trends® in Theoretical Computer Science, 2012
- Locally Decodable Codes and Private Information Retrieval Schemes2010
- 3-query locally decodable codes of subexponential length2009
- Towards 3-query locally decodable codes of subexponential lengthJournal of the ACM, 2008
- Robust Information-Theoretic Private Information RetrievalJournal of Cryptology, 2007
- Robust Information-Theoretic Private Information Retrieval2003
- On the efficiency of local decoding procedures for error-correcting codes2000
- Private information retrievalJournal of the ACM, 1998
- Highly resilient correctors for polynomialsInformation Processing Letters, 1992