Completeness in two-party secure computation: A computational view
From MaRDI portal
Recommendations
- Completeness in two-party secure computation: a computational view
- More general completeness theorems for secure two-party computation
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
- Publication:4941849
- Completeness for symmetric two-party functionalities -- revisited
- Completeness for symmetric two-party functionalities: revisited
- Complete fairness in secure two-party computation
- Complete fairness in secure two-party computation
- Universally composable two-party and multi-party secure computation
- Completeness theorems with constructive proofs for finite deterministic 2-party functions
Cited in
(12)- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation
- A unified characterization of completeness and triviality for secure function evaluation
- More general completeness theorems for secure two-party computation
- scientific article; zbMATH DE number 1418289 (Why is no real title available?)
- Completeness theorems with constructive proofs for finite deterministic 2-party functions
- Completeness in two-party secure computation: a computational view
- Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
- Statistical Security Conditions for Two-Party Secure Function Evaluation
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
- scientific article; zbMATH DE number 1759772 (Why is no real title available?)
This page was built for publication: Completeness in two-party secure computation: A computational view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862422)
