Towards characterizing securely computable two-party randomized functions

DOI10.1007/978-3-319-76578-5_23MaRDI QIDQ1749306zbMATH OpenOpenAlexFDO

Authors Deepesh Data, Manoj Prabhakaran

Publication date 16 May 2018

Full work available at URL https://doi.org/10.1007/978-3-319-76578-5_23

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• Theory of Cryptography
• Perfect secure computation in two rounds
• Tight bounds on the randomness complexity of secure multiparty computation
• Perfect secure computation in two rounds

Cited in

(11)

• Theory of Cryptography
• On fully secure MPC with solitary output
• Computational hardness of optimal fair computation: beyond Minicrypt
• On statistical security in two-party computation
• A zero-one law for secure multi-party computation with ternary outputs
• Randomized functions with high round complexity
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• On the Power of Secure Two-Party Computation
• On perfectly secure two-party computation for symmetric functionalities with correlated randomness
• On the power of secure two-party computation
• Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities

This page was built for publication: Towards characterizing securely computable two-party randomized functions

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