A unified characterization of completeness and triviality for secure function evaluation

DOI10.1007/978-3-642-34931-7_4MaRDI QIDQ2876922zbMATH OpenOpenAlexFDO

Authors Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek

Publication date 20 August 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34931-7_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Completeness in two-party secure computation: A computational view
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• Completeness in two-party secure computation: a computational view
• MPC vs. SFE: Perfect Security in a Unified Corruption Model
• Completeness for symmetric two-party functionalities -- revisited

Cited in

(9)

• On the structure of unconditional UC hybrid protocols
• Completeness for symmetric two-party functionalities: revisited
• scientific article; zbMATH DE number 1583777 (Why is no real title available?)
• Adaptive versus non-adaptive strategies in the quantum setting with applications
• Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions
• Completeness in two-party secure computation: a computational view
• scientific article; zbMATH DE number 1759772 (Why is no real title available?)
• Completeness for symmetric two-party functionalities -- revisited
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation

This page was built for publication: A unified characterization of completeness and triviality for secure function evaluation

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