Information Security

DOI10.1007/11556992zbMath1159.68444OpenAlexW4241272628MaRDI QIDQ5493180

Helger Lipmaa

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11556992

zbMATH Keywords

oblivious transferComputationally-private information retrievallength-flexible additively homomorphic public-key cryptosystem

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (23)

Selling multiple secrets to a single buyer ⋮ Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Sublinear secure computation from new assumptions ⋮ Privacy-enhanced attribute-based private information retrieval ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs ⋮ Two Generic Constructions of Probabilistic Cryptosystems and Their Applications ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ A communication-efficient private matching scheme in client-server model ⋮ On Basing Private Information Retrieval on NP-Hardness ⋮ Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM ⋮ Security and privacy aspects in MapReduce on clouds: a survey ⋮ Private multiparty sampling and approximation of vector combinations ⋮ 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 ⋮ Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy ⋮ A Simpler Rate-Optimal CPIR Protocol ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Private Information Retrieval Using Trusted Hardware ⋮ Some Open Problems in Information-Theoretic Cryptography

This page was built for publication: Information Security