Communication Complexity in Algebraic Two-Party Protocols

DOI10.1007/978-3-540-85174-5_21MaRDI QIDQ3600230zbMATH OpenOpenAlexFDO

Authors 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

algebraic lower boundscommunication complexityfully homomorphic encryptionhomomorphic encryptionkeyword searchPIR writingprivate information retrieval

Mathematics Subject Classification ID

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

Recommendations

• On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
• Minicrypt primitives with algebraic structure and applications
• Minicrypt primitives with algebraic structure and applications
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Partially homomorphic encryption schemes over finite fields

Cited in

(8)

• A direct product theorem for two-party bounded-round public-coin communication complexity
• Communication complexity of conditional disclosure of secrets and attribute-based encryption
• scientific article; zbMATH DE number 1223708 (Why is no real title available?)
• Towards constructing fully homomorphic encryption without ciphertext noise from group theory
• On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
• A simpler rate-optimal CPIR protocol
• Applications of finite non-abelian simple groups to cryptography in the quantum era
• On compression functions over groups with applications to homomorphic encryption

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600230)