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

arXiv:2105.00962 · Journal of Cryptology

From Fairness to Full Security in Multiparty Computation

Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem

Published Dec 7, 2021• 10 citations
arXivHTMLPDF
DOI
10.1007/s00145-021-09415-x

Related papers

From Fairness to Full Security in Multiparty Computation

Ran Cohen, Iftach Haitner, Eran Omri +1 more

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

Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation

Ran Cohen, Yehuda Lindell

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

Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation

Ran Cohen, Yehuda Lindell

Journal of Cryptology•Sep 23, 2016•44 citations

Fair and Efficient Secure Multiparty Computation with Reputation Systems

Gilad Asharov, Yehuda Lindell, Hila Zarosim

Lecture notes in computer science•Jan 1, 2013•31 citations

Towards Multiparty Computation Withstanding Coercion of All Parties

Ran Canetti, Oxana Poburinnaya

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

Universally composable secure multiparty computation protocol with fairness

Tian You-lian

The fair problem of secure multiparty computation protocol was investigated in the universally composable framework. A fair secure multiparty computation model with ideal functionalities was firstly formulated such as a fair secure multiparty addition computation and a fair secure multiparty multiplicative computation. Next a fair addition computation protocol and a fair multiplicative computation protocol based on the bilinear paring and the ideal functionality of a commitment scheme was proposed. The proposed protocols can securely realize their ideal functionalities in the hybrid model respectively. Finally, analysis show that these schemes are effective, and it can be more applicable in special situation.

Journal of Communications•Jan 1, 2014•0 citations
The fair problem of secure multiparty computation protocol was investigated in the universally composable framework. A fair secure multiparty computation model with ideal functionalities was firstly formulated such as a fair secure multiparty addition computation and a fair secure multiparty multiplicative computation. Next a fair addition computation protocol and a fair multiplicative computation protocol based on the bilinear paring and the ideal functionality of a commitment scheme was proposed. The proposed protocols can securely realize their ideal functionalities in the hybrid model respectively. Finally, analysis show that these schemes are effective, and it can be more applicable in special situation.