Completeness for symmetric two-party functionalities: revisited

DOI10.1007/S00145-017-9267-7MaRDI QIDQ2413612zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Completeness for symmetric two-party functionalities -- revisited
• More general completeness theorems for secure two-party computation
• Completeness theorems with constructive proofs for finite deterministic 2-party functions
• Theory of Cryptography
• Completeness in two-party secure computation: a computational view

Cites work

• scientific article; zbMATH DE number 4191075 (Why is no real title available?)
• scientific article; zbMATH DE number 3856987 (Why is no real title available?)
• scientific article; zbMATH DE number 1418289 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• A Zero-One Law for Boolean Privacy
• A unified characterization of completeness and triviality for secure function evaluation
• Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities
• Completeness for symmetric two-party functionalities -- revisited
• Completeness in two-party secure computation: a computational view
• Completeness theorems with constructive proofs for finite deterministic 2-party functions
• Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
• Computational Differential Privacy
• Foundations of Cryptography
• More general completeness theorems for secure two-party computation
• Privacy and Communication Complexity
• Reducibility and Completeness in Private Computations

Cited in

(5)

• All complete functionalities are reversible
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• Completeness in two-party secure computation: A computational view
• Completeness for symmetric two-party functionalities -- revisited
• Correction to: ``Topology-hiding communication from minimal assumptions

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

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