More general completeness theorems for secure two-party computation

DOI10.1145/335305.335342MaRDI QIDQ3191999zbMATH OpenOpenAlexFDO

Authors Joe Kilian

Publication date 26 September 2014

Published in Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/335305.335342

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Completeness theorems with constructive proofs for finite deterministic 2-party functions
• 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
• Completeness in two-party secure computation: A computational view

Cited in

(20)

• Secure non-interactive simulation from arbitrary joint distributions
• Computational hardness of optimal fair computation: beyond Minicrypt
• Randomized functions with high round complexity
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• On the structure of unconditional UC hybrid protocols
• Information-Theoretic Conditions for Two-Party Secure Function Evaluation
• Function secret sharing for mixed-mode and fixed-point secure computation
• Completeness in two-party secure computation: A computational view
• The limits of common coins: further results
• Adaptive versus non-adaptive strategies in the quantum setting with applications
• Sublinear secure computation from new assumptions
• On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments
• Completeness theorems with constructive proofs for finite deterministic 2-party functions
• Completeness for symmetric two-party functionalities -- revisited
• Statistical Security Conditions for Two-Party Secure Function Evaluation
• Completeness for symmetric two-party functionalities: revisited
• Oblivious key-value stores and amplification for private set intersection
• Secure non-interactive simulation: feasibility and rate
• Resource fairness and composability of cryptographic protocols
• Implications of superstrong non-locality for cryptography

This page was built for publication: More general completeness theorems for secure two-party computation

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