scientific article
From MaRDI portal
Publication:3395988
zbMath1169.94341MaRDI QIDQ3395988
Publication date: 15 September 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62)
Related Items (12)
Private Sequential Learning ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ Optimal single-server private information retrieval ⋮ Query-efficient locally decodable codes of subexponential length ⋮ A new multi-server scheme for private information retrieval ⋮ General constructions for information-theoretic private information retrieval ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Another Look at Extended Private Information Retrieval Protocols ⋮ Some Open Problems in Information-Theoretic Cryptography ⋮ Reed-Muller Codes
This page was built for publication:
