Provably secure rational delegation computation protocol

Youliang TIAN; Qiuxian LI; Duo ZHANG; Linjie WANG

doi:10.11959/j.issn.1000-436x.2019133

您当前的位置：

首页 >

文章列表页 >

Provably secure rational delegation computation protocol

Papers | 更新时间：2024-06-05

- Provably secure rational delegation computation protocol
- Journal on Communications Vol. 40, Issue 7, Pages: 135-143(2019)
- 作者机构：
  
  1. 贵州大学计算机科学与技术学院，贵州贵阳 550025
  2. 贵州省公共大数据重点实验室，贵州贵阳 550025
  3. 贵州大学数学与统计学院，贵州贵阳 550025
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61772008);Topnotch Talent in Science and Technology Support Program of Guizhou Province Education Department([2016]060);The Science and Technology Major Support Program of Guizhou Province(20183001);Ministry of Educatio China Mobile Research Fund Project(MCM20170401);Guizhou Provincial Science and Technology Plan Project([2017]5788)
- DOI：10.11959/j.issn.1000-436x.2019133
  CLC： TP309
- Online First：2019-07，
  
  Published：25 July 2019
- 稿件说明：
移动端阅览
Youliang TIAN, Qiuxian LI, Duo ZHANG, et al. Provably secure rational delegation computation protocol[J]. Journal on Communications, 2019, 40(7): 135-143.
DOI：

Youliang TIAN, Qiuxian LI, Duo ZHANG, et al. Provably secure rational delegation computation protocol[J]. Journal on Communications, 2019, 40(7): 135-143. DOI： 10.11959/j.issn.1000-436x.2019133.

摘要

针对理性委托计算中的安全性需求问题，提出了一种可证明安全的理性委托计算协议。首先，在委托计算中引入博弈理论并分析理性参与者的行为偏好，并且在博弈论框架下构建理性委托计算博弈模型；其次，根据博弈模型中的均衡需求及理性委托计算的安全需求，设计理性安全模型；再次，结合Yao的混淆电路可以随机化重用的优势及全同态加密技术，构造理性委托计算协议，且协议中参与者的策略组合可以达到纳什均衡状态；最后，根据理性安全模型证明了协议的安全性和输入输出的隐私性，且性能分析表明了协议的有效性。所提理性委托计算协议在满足传统安全性的同时，又考虑了参与者的行为偏好，更符合大数据环境下的委托计算模式。

Abstract

A provably secure rational delegation computation scheme was proposed to solve the requirement of security issues in rational delegate computation.Firstly

game theory was introduced into delegation computation and according to rational participants behavior preferences analysis

a rational delegate computing game model was designed.Secondly

according to the equilibrium demand of game model and the security requirement of rational delegation computation

a rational security model was established.Thirdly

combining Yao's garbled circuit with its advantages of re-randomization

as well as full homomorphic encryption technology

the rational delegation computation protocol was constructed.And the combination of strategies in the protocol could reach the Nash equilibrium state.Finally

the security of the protocol and the privacy of the input and output were proved according to the rational security model

and the performance analysis shows the validity of the protocol.The proposed rational delegation computing protocol not only satisfies the traditional security

but also considers the behavioral preference of participants

which is more in line with the delegationcomputing mode under the big data environment.

关键词

Keywords

references

GOLDWASSER S , KALAI Y T , ROTHBLUM G N . Delegating computation:interactive proofs for muggles [C ] // ACM Symposium on Theory of Computing . ACM , 2008 : 113 - 122 .

GOLDWASSER S , MICALI S , RACKOFF C . The knowledge complexity of interactive proof systems [J ] . SIAM Journal on Computing , 1989 , 18 ( 1 ): 186 - 208 .

ARORA S , SAFRA S . Probabilistic checking of proofs:a new characterization of NP [J ] . Journal of the ACM , 1998 , 45 ( 1 ): 70 - 122 .

CHUNG K M , KALAI Y , VADHAN S . Advances in cryptology -CRYPTO 2010:improved delegation of computation using fully homomorphic encryption [M ] . Berlin : SpringerPress , 2010 : 483 - 501 .

GENTRY C . A fully homomorphic encryption scheme [M ] . Palo Alto : Stanford University PressPress , 2009 .

GREEN M , HOHENBERGER S , WATERS B . Outsourcing the decryption of ABE ciphertexts [C ] // USENIX Conference on Security . USENIX Association , 2011 : 34 - 34 .

YAO A C , . Protocols for secure computations [C ] // The Annual Symposium on Foundations of Computer Science . IEEE Computer Society , 1982 : 160 - 164

GENNARO R , GENTRY C , PARNO B . Advances in cryptology -CRYPTO 2010:non-interactive verifiable computing:outsourcing computation to untrusted workers [M ] . Berlin : SpringerPress , 2010 : 465 - 482 .

AZAR P D , MICALI S . Rational proofs [C ] // The Annual ACM Symposium on Theory of Computing . ACM , 2012 : 1017 - 1028 .

AZAR P D , MICALI S . Super-efficient rational proofs [C ] // Fourteenth ACM Conference on Electronic Commerce . ACM , 2013 : 29 - 30 .

GUO S , HUBÁČEK P ROSEN A , et al . Rational arguments:single round delegation with sublinear verification [C ] // Conference on Innovations in Theoretical Computer Science . ACM , 2014 : 523 - 540 .

TIAN Y L , PENG C G , LIN D D . Bayesian mechanism for rational secret sharing scheme [J ] . Science China Information Sciences , 2015 , 58 ( 5 ): 1 - 13 .

CHEN J , MCCAULEY S , SINGH S . Rational proofs with multiple provers [J ] . Information Processing Letters , 2015 , 114 ( 11 ): 237 - 248 .

KILIAN J , . A note on efficient zero-knowledge proofs and arguments [C ] // ACM Symposium on Theory of Computing . ACM , 1992 : 723 - 732 .

Quang Duy Lã , CHEW Y H , SOONG B H . An Introduction to Game Theory [M ] . Oxford : Oxford University PressPress , 2005 .

GENTRY C , . Fully homomorphic encryption using ideal lattices [C ] // The ACM Symposium on the Theory of Computing . ACM , 2009 : 169 - 178 .

GENTRY C , HALEVI S , VAIKUNTANATHAN V . I-hop homomorphic encryption and rerandomizable Yao circuits [C ] // The Annual Conference on Advances in Cryptology . IEEE Press , 2010 : 155 - 172 .

KUPCU , ALPTEKIN . Incentivized outsourced computation resistant to malicious contractors [J ] . IEEE Transactions on Dependable and Secure Computing , 2017 , 14 ( 6 ): 633 - 649 .

CHEN X F , LI J , SUSILO W . Efficient fair conditional payments for outsourcing computations [J ] . IEEE Transactions on Information Forensics ＆ Security , 2012 , 7 ( 6 ): 1687 - 1694 .

GENNARO R , GENTRY C , PARNO B . Non-interactive verifiable computing:outsourcing computation to untrusted workers [C ] // Conference on Advances in Cryptology . Springer-Verlag , 2010 : 465 - 482 .

Views

1275

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Fairly verifiable multi-user homomorphic proxy re-encryption scheme

BFV-Blockchainvoting: blockchain-based electronic voting systems with BFV full homomorphic encryption

Post-quantum verifier-based three-party password authenticated key exchange protocol

Efficient signcryption scheme based on Cocks’ identity cryptosystem

Provable data possession scheme with authentication

Related Author

YANG Xun

DING Hongfa

PENG Changgen

HOU Jinqiu

Deli LIU

Yatao YANG

Peihe LIU

Ping ZENG

Related Institution

Nonlinear Analysis and High-Performance Computing Laboratory, School of Science, Guizhou University of Engineering Science

Key Laboratory of Blockchain and Fintech of Department of Education of Guizhou Province, Guizhou University of Finance and Economics

School of Computer Science and Technology, Guizhou University

College of Management Science and Engineering, Anhui University of Finance & Economics

Department of Electronic and Communication Engineering, Beijing Electronics Science and Technology Institute

AI问答

⁰