Completeness for symmetric two-party functionalities: revisited

DOI10.1007/S00145-017-9267-7zbMath1400.94163OpenAlexW2765939664MaRDI QIDQ2413612

Yehuda Lindell, Eran Omri, Hila Zarosim

Publication date: 14 September 2018

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-017-9267-7

zbMATH Keywords

completenesssecure computationhardness assumptionsnon-black-box reductions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Correction to: ``Topology-hiding communication from minimal assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Unified Characterization of Completeness and Triviality for Secure Function Evaluation
• Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
• Computational Differential Privacy
• More general completeness theorems for secure two-party computation
• Completeness in two-party secure computation
• Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
• Privacy and Communication Complexity
• Foundations of Cryptography
• Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities
• Completeness for Symmetric Two-Party Functionalities - Revisited
• Reducibility and Completeness in Private Computations
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• A Zero-One Law for Boolean Privacy

This page was built for publication: Completeness for symmetric two-party functionalities: revisited