Automata, Languages and Programming
From MaRDI portal
Publication:5716829
DOI10.1007/11523468zbMath1084.68043OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716829
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Information storage and retrieval of data (68P20) Authentication, digital signatures and secret sharing (94A62)
Related Items (35)
On the privacy of a code-based single-server computational PIR scheme ⋮ SQL on structurally-encrypted databases ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Optimal single-server private information retrieval ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Privacy-enhanced attribute-based private information retrieval ⋮ Decoy-state quantum private query protocol with two-way communication ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Private join and compute from PIR with default ⋮ A proposal for device independent probabilistic quantum oblivious transfer ⋮ The hunting of the SNARK ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Improved and formal proposal for device-independent quantum private query * ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs ⋮ Simple and efficient two-server ORAM ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ Протокол конфиденциального получения информации ⋮ Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption ⋮ Optimal security proofs for full domain hash. Revisited ⋮ Constraining Pseudorandom Functions Privately ⋮ Asymptotically Tight Bounds for Composing ORAM with PIR ⋮ On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ On Basing Private Information Retrieval on NP-Hardness ⋮ Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem ⋮ Communication-Efficient Private Protocols for Longest Common Subsequence ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Private information retrieval with sublinear online time ⋮ Another Look at Extended Private Information Retrieval Protocols ⋮ A Simpler Rate-Optimal CPIR Protocol ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Some Open Problems in Information-Theoretic Cryptography
This page was built for publication: Automata, Languages and Programming
