通用可组合公平安全多方计算协议

doi:10.3969/j.issn.1000-436x.2014.02.008

Journal on Communications ›› 2014, Vol. 35 ›› Issue (2): 54-62.doi: 10.3969/j.issn.1000-436x.2014.02.008

• academic paper • Previous Articles Next Articles

Universally composable secure multiparty computation protocol with fairness

You-liang TIAN^1,²,Chang-gen PENG¹,Jian-feng MA²,Hui LIN²,Kai YANG³

¹ College of Science, Guizhou University, Guiyang 550025, China;
² School of Computer Science and Technology, Xidian University, Xi'an 710071, China;
³ Key Laboratory of Information Security and Secrecy of CAPF, Department of Electronic Technology, Engineering University of CAPF, Xi'an 710086, China

Online:2014-02-25 Published:2017-07-25
Supported by:
The Major National Science and Technology program;The Major National Science and Technology program;China Postdoctoral Science Foundation;China Postdoctoral Science Foundation;The Nature Science Foundation of Guizhou Province;The Nature Science Foundation of Guizhou Province;TheNationalNaturalScienceFoundationofChina;TheNationalNaturalScienceFoundationofChina;TheNationalNaturalScienceFoundationofChina;TheNationalNaturalScienceFoundationofChina;TheDoctorsScienceFoundationofGuizhouUniversity

Abstract

Abstract:

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.

Key words: UC framework, secure multiparty computation, fairness; bilinear pairing, bilinear Diffie-Hellman assumption

You-liang TIAN,Chang-gen PENG,Jian-feng MA,Hui LIN,Kai YANG. Universally composable secure multiparty computation protocol with fairness[J]. Journal on Communications, 2014, 35(2): 54-62.

Figures/Tables 5

References 19

[1]	YAO A . Protocols for secure computations[A]. Proc 23rd IEEE Symp On the Foundation of Computer Science[C]. 1982. 160-164.
[2]	CLEVE R . Limits on the security of coin flips when half the processors are faulty[A]. 18th STOC[C]. 1986. 364-369.
[3]	DOV GORDON S , HAZAY C , KATZ J . Complete fairness in secure two-party computation[A]. STOC'08[C]. 2008. 17-26.
[4]	BONEH D , NAOR M . Timed commitments[A]. Crypto 2000[C]. 2000. 236-254.
[5]	ASOKAN N , SCHUNTER M , WAIDNER M . Optimistic protocols for fair exchange[A]. CCS[C].ACM, 1997. 7-17.
[6]	KATZ J . On achieving the “best of both worlds” in secure multiparty computation[A]. STOC[C]. 2007. 11-20.
[7]	DOV GORDON S , KATZ J . Partial fairness in secure two-party computation[A]. EUROCRYPT 2010[C]. Springer-Verlag 2010. 157-176.
[8]	BENOR M , GOLDWASSER S , WIGDERSON A . Completeness theorems for noncryptographic fault-tolerant distributed computation (extended abstract)[A]. STOC1988[C].ACM. 1988. 1-10.
[9]	CHAUM D , CCREPEAU S , DAMGARD I . Multiparty unconditionally secure protocols (extended abstract)[A]. STOC1988[C].ACM. 1988. 1-19.
[10]	RABIN T , BENNOR M . Verifiable secret sharing and multiparty protocols with honest majority (extended abstract)[A]. STOC1989[C].ACM. 1989. 73-85.
[11]	DOV GORDON S , ISHAI T , MORAN T , OSTROVSKY R et al. On complete primitives for fairness[J]. TCC2010 IEEE[C]. 2010. 91-108.
[12]	CANETTI R et al. Universally composable security: a new paradigm for cryptographic protocols[J]. a revised version (2005) is available at IACR eprint archive[EB/OL]. .
[13]	ZHANG F , MA J F , MOON S J . Universally composable anonymous Hash certification model[J]. Sci China Inf Sci, 2007. 440-445.
[14]	FENG T , LI F H , MA J F et al. A new approach for UC security concurrent deniable authentication[J]. Sci China Inf Sci, 2008,51 352-367.
[15]	ZHANG J W , MA J F , MOON S J . Universally composable secure TNC model and EAP-TNC protocol in IF-T[J]. Sci China Inf Sci, 2010,53 465-482.
[16]	ZHANG J W , MA J F , MOON S J . Universally composable one-time signature and broadcast authentication[J]. Sci China Inf Sci, 2010,53 567-580.
[17]	田有亮，马建峰，彭长根等. 群组通信的通用可组合机制[J]. 计算机学报， 2012,35(4): 645-653. TIAN Y L , MA J F , PENG C G et al. Universally composable mecha-nism for group communication[J]. Chinese Journal of Computers, 2012,35(4): 645-653.
[18]	张妤，胡杰 . UC安全计算的一种信任模型[J]. 四川大学学报(工程科学版)， 2012,44(3): 106-111. ZHANG Y , HU J . A trust model of UC secure computation[J]. Journal of Sichuan University(Engineering Science Edition), 2012,44(3): 106-111.
[19]	BONEH D , FRANKLIN M . Identity based encryption from the weil pairing[J]. SIAM J of computing, Extended Abstract in Crypto, 2003,32(3): 586-615.

Metrics

Recommended 0

No Suggested Reading articles found!

Universally composable secure multiparty computation protocol with fairness

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 5

References 19

Related Articles 6

Metrics

Recommended 0

[1]	Lichuan MA, Jiayi PENG, Qingqi PEI, Haojin ZHU. Efficient privacy-preserving decision tree classification protocol [J]. Journal on Communications, 2021, 42(8): 80-89.
[2]	. Fair multi-party concurrent signature scheme [J]. Journal on Communications, 2014, 35(3): 16-149.
[3]	. Universally composable secure multiparty computation protocol with fairness [J]. Journal on Communications, 2014, 35(2): 8-62.
[4]	Yuan TIAN,Rong-xin SUN,Wu-yang CAI. GUC-secure protocol for private relational join operator computing [J]. Journal on Communications, 2014, 35(11): 107-116.
[5]	. GUC-secure protocol for private relational join operator computing [J]. Journal on Communications, 2014, 35(11): 12-106.
[6]	Xuan HONG,Ke-fei CHEN,Qiang LI. Universal composable threshold signature [J]. Journal on Communications, 2009, 30(6): 1-6.