More general completeness theorems for secure two-party computation

DOI10.1145/335305.335342zbMath1296.94123OpenAlexW1964580496MaRDI QIDQ3191999

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)

Related Items

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Oblivious key-value stores and amplification for private set intersection ⋮ On the structure of unconditional UC hybrid protocols ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Completeness for symmetric two-party functionalities: revisited ⋮ Implications of superstrong non-locality for cryptography ⋮ Sublinear secure computation from new assumptions ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Resource fairness and composability of cryptographic protocols ⋮ Information-Theoretic Conditions for Two-Party Secure Function Evaluation ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications ⋮ The Limits of Common Coins: Further Results ⋮ Statistical Security Conditions for Two-Party Secure Function Evaluation