scientific article; zbMATH DE number 1754644
From MaRDI portal
Publication:4535072
zbMath0986.68509MaRDI QIDQ4535072
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760912
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20)
Related Items (13)
Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Single-server private information retrieval with sublinear amortized time ⋮ On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ On the optimal communication complexity of error-correcting multi-server PIR ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Homomorphic secret sharing for low degree polynomials ⋮ Lower bounds for adaptive locally decodable codes ⋮ General constructions for information-theoretic private information retrieval ⋮ Multi-value private information retrieval with colluding databases via trace functions ⋮ Private information retrieval with sublinear online time ⋮ An optimal lower bound for 2-query locally decodable linear codes
This page was built for publication:
