[Resource Topic] 2011/577: An Efficient Protocol for the Commit-Prove-Fair-Open functionality

Welcome to the resource topic for 2011/577

An Efficient Protocol for the Commit-Prove-Fair-Open functionality

Authors: Ou Ruan, Cai Fu, Guohua Cui


In TCC 2006, Garay et al. introduced the notion of “commit-prove-fair-open” functionality in order to achieve what they called “resource fairness” of secure multi-party computation(MPC) with corrupted majority. The protocol realizing this notion of fairness follows the gradual release approach and, further, it can be proven secure in the simulation paradigm and enjoys composition properties. In this paper, we show a more efficient resource-fair protocol of FCPFO based on a new variant of Garay et al. time-lines and simplified Camenisch-Shoup(sCS) commitment,whose communication and computation complexity are less than 1/5 of Garay et al. construction. In addition, our new protocol allows commitment to value 0, which is not possible in the plain Garay et al. construction.

ePrint: https://eprint.iacr.org/2011/577

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .