Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On the (In)Efficiency of Non-Interactive Secure Multiparty Computation

Maki Yoshida, Satoshi Obana

Published Jan 1, 2016• 5 citations
Publisher
DOI
10.1007/978-3-319-30840-1_12

Related papers

An Efficient Construction of Non-Interactive Secure Multiparty Computation

Satoshi Obana, Maki Yoshida

Lecture notes in computer science•Jan 1, 2016•4 citations

Efficient Constructions of Non-interactive Secure Multiparty Computation from Pairwise Independent Hashing

Satoshi Obana, Maki Yoshida

International Joint Conference on e-Business and Telecommunications (ICETE)•Jan 1, 2020•2 citations

Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions

Reo Eriguchi, Kazuma Ohara, Shota Yamada +1 more

Lecture notes in computer science•Jan 1, 2021•5 citations

Non-Interactive Secure Multiparty Computation

Amos Beimel, Ariel Gabizon, Yuval Ishai +3 more

Lecture notes in computer science•Jan 1, 2014•83 citations

Multiparty Reusable Non-Interactive Secure Computation.

Fabrice Benhamouda, Huijia Lin

•Jan 1, 2020•3 citations

Efficient Secure Multiparty Computation with Identifiable Abort

Carsten Baum, Emmanuela Orsini, Peter Schöll

Lecture notes in computer science•Jan 1, 2016•37 citations