Information Security and Privacy

DOI10.1007/b98755zbMath1098.68038OpenAlexW4299784765WikidataQ56387667 ScholiaQ56387667MaRDI QIDQ5315290

Yan-Cheng Chang

Publication date: 7 September 2005

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Information storage and retrieval of data (68P20) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Similarity Based Interactive Private Information Retrieval ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Sublinear secure computation from new assumptions ⋮ Optimal single-server private information retrieval ⋮ Privacy-enhanced attribute-based private information retrieval ⋮ Hypercubes and Private Information Retrieval ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ A communication-efficient private matching scheme in client-server model ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments

This page was built for publication: Information Security and Privacy