Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
From MaRDI portal
Publication:2128566
DOI10.1007/978-3-030-84245-1_11zbMath1486.94097OpenAlexW3187814643MaRDI QIDQ2128566
Kazuma Ohara, Reo Eriguchi, Shota Yamada, Koji Nuida
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_11
Related Items
Cites Work
- Unnamed Item
- Best possible information-theoretic MPC
- The complexity of multiparty PSM protocols and related models
- On the (in)efficiency of non-interactive secure multiparty computation
- Robust non-interactive multiparty computation against constant-size collusion
- Support-vector networks
- An efficient construction of non-interactive secure multiparty computation
- Uncovering algebraic structures in the MPC landscape
- Secure Multiparty Computation with General Interaction Patterns
- A minimal model for secure computation (extended abstract)
- Non-Interactive Secure Multiparty Computation
- Secure Computation on the Web: Computing without Simultaneous Interaction
- Ad Hoc PSM Protocols: Secure Computation Without Coordination