Communication Complexity in Algebraic Two-Party Protocols

DOI10.1007/978-3-540-85174-5_21zbMath1183.94043OpenAlexW2146723108MaRDI QIDQ3600230

Rafail Ostrovsky, William E. Skeith

Publication date: 10 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_21

zbMATH Keywords

communication complexityhomomorphic encryptionfully homomorphic encryptionprivate information retrievalkeyword searchalgebraic lower boundsPIR writing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Information storage and retrieval of data (68P20)

Related Items (3)

Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption ⋮ Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory ⋮ A Simpler Rate-Optimal CPIR Protocol

This page was built for publication: Communication Complexity in Algebraic Two-Party Protocols