A Geometric Approach to Information-Theoretic Private Information Retrieval
From MaRDI portal
Publication:3519387
DOI10.1137/06065773XzbMath1156.68019OpenAlexW2048659729MaRDI QIDQ3519387
Sergey Yekhanin, David P. Woodruff
Publication date: 14 August 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/06065773x
Cryptography (94A60) Information storage and retrieval of data (68P20) Authentication, digital signatures and secret sharing (94A62)
Related Items (16)
Towards breaking the exponential barrier for general secret sharing ⋮ Single-server private information retrieval with sublinear amortized time ⋮ On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ On \(d\)-multiplicative secret sharing ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ On the optimal communication complexity of error-correcting multi-server PIR ⋮ Query-efficient locally decodable codes of subexponential length ⋮ A novel elementary construction of matching vectors ⋮ Communication-efficient distributed oblivious transfer ⋮ Протокол конфиденциального получения информации ⋮ General constructions for information-theoretic private information retrieval ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ Fast Hermite interpolation and evaluation over finite fields of characteristic two ⋮ Multi-value private information retrieval with colluding databases via trace functions ⋮ A geometric approach to homomorphic secret sharing ⋮ High-rate codes with sublinear-time decoding
This page was built for publication: A Geometric Approach to Information-Theoretic Private Information Retrieval
