Completeness theorems with constructive proofs for finite deterministic 2-party functions

DOI10.1007/978-3-642-19571-6_22zbMATH Open1295.94096OpenAlexW1595928746MaRDI QIDQ3000549FDOQ3000549

Joern Mueller-Quade, Daniel Kraschewski

Publication date: 19 May 2011

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_22

Recommendations

• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• More general completeness theorems for secure two-party computation
• 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

zbMATH Keywords

information-theoretic securityoblivious transfersecure function evaluationuniversal composabilitycomplete primitives

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (7)

• Reducibility and Completeness in Private Computations
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• On the structure of unconditional UC hybrid protocols
• Completeness in two-party secure computation: A computational view
• Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications
• The Limits of Common Coins: Further Results
• Completeness for symmetric two-party functionalities: revisited

This page was built for publication: Completeness theorems with constructive proofs for finite deterministic 2-party functions

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