Back to Results
First PageMeta Content
Theoretical computer science / Cryptography / Finite fields / Polynomials / Reed–Solomon error correction / Berlekamp–Welch algorithm / List decoding / Randomized algorithm / XTR / Coding theory / Error detection and correction / Mathematics


Optimally Robust Private Information Retrieval∗ Casey Devet Ian Goldberg University of Waterloo {cjdevet,iang}@cs.uwaterloo.ca
Add to Reading List

Document Date: 2012-06-20 13:33:02


Open Document

File Size: 212,54 KB

Share Result on Facebook

Company

NTL / Intel / /

Country

Sudan / /

/

Facility

Nadia Heninger University of California / NTL library / Optimally Robust Private Information Retrieval∗ Casey Devet Ian Goldberg University of Waterloo / /

IndustryTerm

polynomial-time polynomial lattice basis reduction algorithms / multi-polynomial algorithm / linear multi-polynomial decoding algorithm / particular server / portfolio algorithm / to that algorithm / anonymous communication networks / polynomial-time algorithm / lattice reduction algorithm / brute-force decoding algorithm / direct algorithms / dynamic programming algorithm / linear multi-polynomial algorithm / error correction algorithms / privacy-enhancing technologies / user-facing applications / remote server / database server / list-decoding algorithms / privacy-sensitive applications / polynomial lattice basis row reduction algorithm / brief outline in Algorithm / exponential-time brute force decoding algorithm / error correction algorithm / client-side decoding algorithms / error-correction algorithms / online database / list decoding algorithm / client-side processing / polynomial solution / brute-force algorithm / non-private protocol / above decoding algorithms / multi-polynomial decoding algorithm / /

OperatingSystem

Linux / Ubuntu / /

Organization

University of Waterloo / University of California / San Diego / /

Person

Casey Devet Ian / /

Position

player / dealer / /

Product

Guruswami-Sudan / /

ProgrammingLanguage

R / C++ / /

ProvinceOrState

California / /

Technology

direct algorithms / three algorithms / portfolio algorithm / 5.2 Portfolio algorithms / error correction algorithms / Guruswami-Sudan list decoding algorithm / COVER algorithm / polynomial-time polynomial lattice basis reduction algorithms / lattice reduction algorithm / t-private PIR protocol / Linux / ECOVER algorithm / privacy-enhancing technologies / list-decoding algorithms / One non-private protocol / laptop computer / decoding algorithm / above decoding algorithms / multi-polynomial algorithm / PIR protocol / client-side decoding algorithms / error correction algorithm / Implementation Algorithm / Berlekamp-Welch algorithm / brute-force decoding algorithm / potentially exponential-time brute force decoding algorithm / 3 Protocols / brute-force algorithm / previous PIR protocols / Our protocol / Guruswami-Sudan algorithm / error-correction algorithms / polynomial lattice basis row reduction algorithm / linear multi-polynomial decoding algorithm / polynomial-time algorithm / PIR protocols / 4 Our algorithm Our algorithm / 2007 protocol / linear multi-polynomial algorithm / dynamic programming algorithm / multi-polynomial decoding algorithm / Cohn-Heninger algorithm / four algorithms / /

SocialTag