Paper 2011/577 Original: eprint.iacr.org/2011/577 ↗
An Efficient Protocol for the Commit-Prove-Fair-Open functionality
Abstract
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2011-11-02: last updated
- 2011-11-02: published
- Short URL
- https://ia.cr/2011/577
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/577,
author = {Ou Ruan and Cai Fu and Guohua Cui},
title = {An Efficient Protocol for the Commit-Prove-Fair-Open functionality},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/577},
year = {2011},
url = {https://eprint.iacr.org/2011/577}
}