A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
From MaRDI portal
Publication:5418721
DOI10.1007/978-3-642-55220-5_36zbMath1328.68065OpenAlexW288835672MaRDI QIDQ5418721
Daniel Kraschewski, Manoj Prabhakaran, Amit Sahai, Hemanta K. Maji
Publication date: 27 May 2014
Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_36
Parametric hypothesis testing (62F03) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)
Related Items (7)
On the structure of unconditional UC hybrid protocols ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Secure non-interactive reduction and spectral analysis of correlations ⋮ Completeness for symmetric two-party functionalities: revisited ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Secure non-interactive reducibility is decidable ⋮ Cryptography from one-way communication: on completeness of finite channels
This page was built for publication: A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
