Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
From MaRDI portal
Publication:3000549
DOI10.1007/978-3-642-19571-6_22zbMath1295.94096OpenAlexW1595928746MaRDI QIDQ3000549
Jörn Müller-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
secure function evaluationinformation-theoretic securityoblivious transferuniversal composabilitycomplete primitives
Related Items
On the structure of unconditional UC hybrid protocols, Completeness for symmetric two-party functionalities: revisited, Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications, The Limits of Common Coins: Further Results