Randomized functions with high round complexity

DOI10.1007/978-3-031-48615-9_12MaRDI QIDQ6581793zbMATH OpenFDO

Authors Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen

Publication date 1 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48615-9_12

zbMATH Keywords

generalized convex hullgeometry of secure computationhydrodynamicsinformation-theoretic securitylamination hullround complexitysemi-honest adversarytwo-party secure computation

Mathematics Subject Classification ID

Randomized algorithms (68W20) Information theory (general) (94A15) Cryptography (94A60)

Recommendations

• Towards characterizing securely computable two-party randomized functions
• scientific article; zbMATH DE number 1942420
• A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
• Perfect secure computation in two rounds
• The Exact Round Complexity of Secure Computation

Cites work

• Contour dynamics of incompressible 3-D fluids in a porous medium with different densities
• scientific article; zbMATH DE number 4191075 (Why is no real title available?)
• Lack of uniqueness for weak solutions of the incompressible porous media equation
• Lamination convex hull of stationary incompressible porous media equations
• More general completeness theorems for secure two-party computation
• Non-compact lamination convex hulls.
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Secure multiparty computation goes live
• The Euler equations as a differential inclusion
• Towards characterizing securely computable two-party randomized functions
• Über den Variabilitätsbereich der Fourierschen Konstanten von positiven harmonischen Funktionen.

This page was built for publication: Randomized functions with high round complexity

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