Completeness for symmetric two-party functionalities: revisited
From MaRDI portal
Publication:2413612
DOI10.1007/S00145-017-9267-7zbMATH Open1400.94163OpenAlexW2765939664MaRDI QIDQ2413612FDOQ2413612
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
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
- Foundations of Cryptography
- Title not available (Why is that?)
- Computational Differential Privacy
- A Zero-One Law for Boolean Privacy
- Privacy and Communication Complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- More general completeness theorems for secure two-party computation
- Title not available (Why is that?)
- Completeness theorems with constructive proofs for finite deterministic 2-party functions
- Completeness in two-party secure computation: a computational view
- Completeness for Symmetric Two-Party Functionalities - Revisited
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
- A Unified Characterization of Completeness and Triviality for Secure Function Evaluation
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
- Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities
- Reducibility and Completeness in Private Computations
Cited In (3)
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)
