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

Efficient Secure Multiparty Computation with Identifiable Abort

Carsten Baum, Emmanuela Orsini, Peter Schöll

Published Jan 1, 2016• 36 citations
Publisher
DOI
10.1007/978-3-662-53641-4_18

Related papers

Secure Multiparty Computation with Identifiable Abort via Vindicating Release

Ran Cohen, Jack Doerner, Yashvanth Kondi +1 more

Lecture notes in computer science•Jan 1, 2024•8 citations

Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort

Bar Alon, Hao Chung, Kai-Min Chung +3 more

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

Secure Multi-Party Computation with Identifiable Abort

Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas

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

Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort

Kai-Min Chung, Mi-Ying Huang, Er-Cheng Tang +1 more

arXiv:2211.01665•Lecture notes in computer science•Jan 1, 2024•0 citations

An Efficient Construction of Non-Interactive Secure Multiparty Computation

Satoshi Obana, Maki Yoshida

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

Efficient Maliciously Secure Multiparty Computation for RAM

Marcel Keller, Avishay Yanai

Lecture notes in computer science•Jan 1, 2018•36 citations