A Simpler Rate-Optimal CPIR Protocol

DOI10.1007/978-3-319-70972-7_35zbMath1460.94054OpenAlexW2751898049MaRDI QIDQ5854446

Kateryna Pavlyk, Helger Lipmaa

Publication date: 17 March 2021

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-70972-7_35

zbMATH Keywords

communication complexitycryptographic protocolsoptimal ratecomputationally-private information retrieval

Mathematics Subject Classification ID

Cryptography (94A60) Communication complexity, information complexity (68Q11)

Related Items (4)

On the privacy of a code-based single-server computational PIR scheme ⋮ Compressible FHE with applications to PIR ⋮ A survey on single server private information retrieval in a coding theory perspective ⋮ \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH

Cites Work

• Communication Optimal Tardos-Based Asymmetric Fingerprinting
• Evaluating Branching Programs on Encrypted Data
• Communication Complexity in Algebraic Two-Party Protocols
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Branching Programs and Binary Decision Diagrams
• Strong Conditional Oblivious Transfer and Computing on Intervals
• Information Security
• Automata, Languages and Programming
• Advances in Cryptology - ASIACRYPT 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Simpler Rate-Optimal CPIR Protocol