<--- Back to Details
First PageDocument Content
Applied mathematics / Coding theory / Mathematics / Private information retrieval / Finite fields / Computational complexity theory / Oblivious transfer / Locally decodable code / Information retrieval / Theoretical computer science / Cryptographic protocols / Error detection and correction
Date: 2010-11-09 13:29:34
Applied mathematics
Coding theory
Mathematics
Private information retrieval
Finite fields
Computational complexity theory
Oblivious transfer
Locally decodable code
Information retrieval
Theoretical computer science
Cryptographic protocols
Error detection and correction

contributed articles Cryptographic protocols safeguard the privacy of user queries to public databases.

Add to Reading List

Source URL: research.microsoft.com

Download Document from Source Website

File Size: 4,44 MB

Share Document on Facebook

Similar Documents

Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25

Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25

DocID: 1uCk4 - View Document

On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th

On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th

DocID: 1uruF - View Document

Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat

Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat

DocID: 1ulr8 - View Document

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs Marek Karpi´ nski1, , Andrzej Ruci´ nski2, , and Edyta Szyma´ nska2,  

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs Marek Karpi´ nski1, , Andrzej Ruci´ nski2, , and Edyta Szyma´ nska2,  

DocID: 1tW23 - View Document

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

DocID: 1ruap - View Document