面向理性用户的秘密重构设计模型

刘海; 田有亮; 唐莹; Jianbing Ni; 马建峰

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

您当前的位置：

首页 >

文章列表页 >

面向理性用户的秘密重构设计模型

专题：计算机通信与网络系统安全技术 | 更新时间：2024-06-05

- 面向理性用户的秘密重构设计模型
- Design models of secret reconstruction towards rational users
- 通信学报 2021年42卷第11期页码：54-65
- 作者机构：
  
  1. 贵州财经大学信息学院，贵州贵阳 550025
  2. 中国科学院软件研究所可信计算与信息保障实验室，北京 100190
  3. 贵州大学公共大数据国家重点实验室，贵州贵阳 550025
  4. 贵州财经大学发展规划与学科建设办公室，贵州贵阳550025
  5. 女王大学电子与计算机学院，金斯顿 K7L 3N6
- 作者简介：
  
  [ "刘海（1984− ），男，河北献县人，博士，贵州财经大学副教授，主要研究方向为密码协议、大数据安全和隐私保护" ]
  [ "田有亮（1982− ），男，贵州盘县人，博士，贵州大学教授、博士生导师，主要研究方向为密码学与隐私计算等" ]
  [ "唐莹（1982− ），女，重庆人，贵州财经大学教师，主要研究方向为博弈论和数据安全" ]
  [ "Jianbing Ni（1988− ），男，博士，女王大学助理教授，主要研究方向为无线通信和网络安全、移动计算安全、机器学习安全和区块链技术" ]
  [ "马建峰（1963− ），男，陕西西安人，博士，西安电子科技大学教授、博士生导师，主要研究方向为应用密码学、无线网络安全、数据安全、移动智能系统安全等" ]
- 基金信息：
  
  国家自然科学基金资助项目(62062071);贵州省科技计划基金资助项目([2020]1Y265)
- DOI：10.11959/j.issn.1000-436x.2021195
  中图分类号： TP391
- 网络出版日期：2021-11，
  
  纸质出版日期：2021-11-25
- 稿件说明：
移动端阅览
刘海, 田有亮, 唐莹, 等. 面向理性用户的秘密重构设计模型[J]. 通信学报, 2021,42(11):54-65.

Hai LIU, Youliang TIAN, Ying TANG, et al. Design models of secret reconstruction towards rational users[J]. Journal on communications, 2021, 42(11): 54-65.
刘海, 田有亮, 唐莹, 等. 面向理性用户的秘密重构设计模型[J]. 通信学报, 2021,42(11):54-65. DOI： 10.11959/j.issn.1000-436x.2021195.

Hai LIU, Youliang TIAN, Ying TANG, et al. Design models of secret reconstruction towards rational users[J]. Journal on communications, 2021, 42(11): 54-65. DOI： 10.11959/j.issn.1000-436x.2021195.

摘要

理性秘密重构是为了约束理性用户的自利性，在现实生活中确保所有参与用户均能获得共享秘密。然而，如果直接使用现有的理性秘密重构协议，不仅不能实现公平的秘密重构，甚至还会出现用户将虚假的秘密视为真实共享秘密的极端情形。导致上述现象的根本原因是缺乏参考模型，使协议设计者难以全面地考虑理性用户参与秘密重构时的自利行为。为解决该问题，通过形式化描述理性用户模型和理性秘密重构博弈模型来分析理性用户执行秘密重构协议时的先后顺序以及策略选择对公平秘密重构的影响，分别提出了面向纯理性用户环境、面向信誉环境和面向可信用户环境3种适用于不同场景的理性秘密重构协议设计模型。理论证明了所提模型能帮助协议设计者有效约束理性用户的自利性，设计了公平的理性秘密重构协议。此外，基于提出的设计模型，还构造了一个公平的理性秘密重构协议来证明所提模型的可用性。

Abstract

Rational Secret Reconstruction is an intersection between traditional secret reconstruction and game theory

which aims to restrict the selfish behaviors of rational users

making both of them obtain the secret in real applications.However

when directly adopting the existing rational secret reconstruction protocols

it is infeasible to realize the fair secret reconstruction.More seriously

an extreme situation may rise

which is some users regard a fake secret as the real one.The crucial reason is that

due to lack of design models

the protocol designers cannot completely consider their selfish behaviors when rational users participate in secret reconstruction.To solve that problem

through the formalizations of rational users and rational secret reconstruction game

the influences of rational users’ action order and their chosen strategies about the fair secret reconstruction were analyzed

and then

three design models for the different scenarios

including purely user rational scenario

reputation-based scenario and trusted user-based scenario

were proposed respectively.Theoretical analysis demonstrates that

the proposed models can help the designers restrict rational users’ selfishness effectively

thereby guiding the designers to devise the fair rational secret reconstruction protocols.Additionally

under the guidance of the proposed models

a fair rational secret reconstruction protocol was devised

which indicated that the proposed models were usable.

关键词

Keywords

references

KHAN W Z , AHMED E , HAKAK S , et al . Edge computing:a survey [J ] . Future Generation Computer Systems , 2019 , 97 : 219 - 235 .

HABIBI P , FARHOUDI M , KAZEMIAN S , et al . Fog computing:a comprehensive architectural survey [J ] . IEEE Access , 2020 , 8 : 69105 - 69133 .

GAI K K , GUO J N , ZHU L H , et al . Blockchain meets cloud computing:a survey [J ] . IEEE Communications Surveys ＆ Tutorials , 2020 , 22 ( 3 ): 2009 - 2030 .

谭振华 , 杨广明 , 王兴伟 , 等 . 面向云存储的多维球面门限秘密共享方案 [J ] . 软件学报 , 2016 , 27 ( 11 ): 2912 - 2928 .

TAN Z H , YANG G M , WANG X W , et al . Threshold secret sharing scheme based on multidimensional sphere for cloud storage [J ] . Journal of Software , 2016 , 27 ( 11 ): 2912 - 2928 .

ATTASENA V , DARMONT J , HARBI N . Secret sharing for cloud data security:a survey [J ] . The VLDB Journal , 2017 , 26 ( 5 ): 657 - 681 .

马利民 , 王佳慧 . 基于改进FEMD算法的可逆秘密图像共享方案 [J ] . 通信学报 , 2019 , 40 ( 7 ): 48 - 56 .

MA L M , WANG J H . Invertible secret image sharing scheme based on improved FEMD [J ] . Journal on Communications , 2019 , 40 ( 7 ): 48 - 56 .

CAPUTO S , KORCHMÁROS G , SONNINO A . Multilevel secret sharing schemes arising from the normal rational curve [J ] . Discrete Applied Mathematics , 2020 , 284 : 158 - 165 .

YANG J , FU F W . New dynamic and verifiable multi-secret sharing schemes based on LFSR public key cryptosystem [J ] . IET Information Security , 2020 , 14 ( 6 ): 783 - 790 .

DESMEDT Y , SLINKO A . Realistic versus rational secret sharing [C ] // Lecture Notes in Computer Science . Berlin:Springer , 2019 : 152 - 163 .

HALPERN J , TEAGUE V . Rational secret sharing and multiparty computation:extended abstract [C ] // Proceedings of the thirty-sixth annual ACM symposium on Theory of computing – STOC’04 . New York:ACM Press , 2004 : 623 - 632 .

MALEKA S , SHAREEF A , PANDU R C . The deterministic protocol for rational secret sharing [C ] // Proceedings of 2008 IEEE International Symposium on Parallel and Distributed Processing . Piscataway:IEEE Press , 2008 : 1 - 7 .

MALEKA S , SHAREEF A , RANGAN C P . Rational secret sharing with repeated games [C ] // Information Security Practice and Experience . Berlin:Springer , 2008 : 334 - 346 .

KOL G , NAOR M . Cryptography and game theory:designing protocols for exchanging information [C ] // Theory of Cryptography . Berlin:Springer , 2008 : 320 - 339 .

KOL G , NAOR M . Games for exchanging information [C ] // Proceedings of the fortieth annual ACM symposium on Theory of computing . New York:ACM Press , 2008 : 423 - 432 .

FUCHSBAUER G , KATZ J , NACCACHE D . Efficient rational secret sharing in standard communication networks [C ] // Theory of Cryptography . Berlin:Springer , 2010 : 419 - 436 .

CAI Y Q , SHI H L . Rational secret sharing scheme based on probability encryption without trusted center [J ] . Journal of Networks , 2011 , 6 ( 6 ): 899 - 903 .

DANI V , MOVAHEDI M , SAIA J . Scalable mechanisms for rational secret sharing [J ] . Distributed Computing , 2015 , 28 ( 3 ): 171 - 187 .

KAWACHI A , OKAMOTO Y , TANAKA K , et al . General constructions of rational secret sharing with expected constant-round reconstruction [J ] . The Computer Journal , 2016 , 60 ( 5 ): 711 - 728 .

ZHANG Z F , LIU M L . Unconditionally secure rational secret sharing in standard communication networks [C ] // Information Security and Cryptology - ICISC 2010 . Berlin:Springer , 2011 : 355 - 369 .

ZHANG E , YUAN P Y , DU J . Verifiable rational secret sharing scheme in mobile networks [J ] . Mobile Information Systems , 2015 , 2015 : 1 - 7 .

DE S J , RUJ S . Failure tolerant rational secret sharing [C ] // Proceedings of 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA) . Piscataway:IEEE Press , 2016 : 925 - 932 .

田有亮 , 王雪梅 , 刘琳芳 . 基于马尔可夫决策的理性秘密共享方案 [J ] . 通信学报 , 2015 , 36 ( 9 ): 222 - 229 .

TIAN Y L , WANG X M , LIU L F . Rational secret sharing scheme based on Markov decision [J ] . Journal on Communications , 2015 , 36 ( 9 ): 222 - 229 .

NOJOUMIAN M , STINSON D R . Socio-rational secret sharing as a new direction in rational cryptography [C ] // Lecture Notes in Computer Science . Berlin:Springer , 2012 : 18 - 37 .

NOJOUMIAN M , . Generalization of socio-rational secret sharing with a new utility function [C ] // Proceedings of 2014 Twelfth Annual International Conference on Privacy,Security and Trust . Piscataway:IEEE Press , 2014 : 338 - 341 .

WANG Y L , XU Q L . 2-out-of-2 rational secret sharing in extensive form [C ] // Proceedings of 2011 Seventh International Conference on Computational Intelligence and Security . Piscataway:IEEE Press , 2011 : 847 - 851 .

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

WANG J , CAI Y Q . A rational secret sharing scheme based on repeated game [C ] // Proceedings of 2011 Seventh International Conference on Computational Intelligence and Security . Piscataway:IEEE Press , 2011 : 615 - 619 .

YU Y , ZHOU Z F . An efficient rational secret sharing protocol resisting against malicious adversaries over synchronous channels [C ] // Information Security and Cryptology . Berlin:Springer , 2013 : 69 - 89 .

彭长根 , 刘海 , 田有亮 , 等 . 混合偏好模型下的分布式理性秘密共享方案 [J ] . 计算机研究与发展 , 2014 , 51 ( 7 ): 1476 - 1485 .

PENG C G , LIU H , TIAN Y L , et al . A distributed rational secret sharing scheme with hybrid preference model [J ] . Journal of Computer Research and Development , 2014 , 51 ( 7 ): 1476 - 1485 .

ASHAROV G , LINDELL Y . Utility dependence in correct and fair rational Secret Sharing [J ] . Journal of Cryptology , 2011 , 24 ( 1 ): 157 - 202 .

DE S J , PAL A K . Achieving correctness in fair rational secret sharing [C ] // Cryptology and Network Security . Cham:Springer International Publishing , 2013 : 139 - 161 .

DE S J , RUJ S , PAL A K . Should silence be heard? fair rational secret sharing with silent and non-silent players [C ] // Cryptology and Network Security . Cham:Springer International Publishing , 2014 : 240 - 255 .

JIN J H , ZHOU X , MA C G , et al . A rational secret sharing relying on reputation [C ] // Proceedings of 2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS) . Piscataway:IEEE Press , 2016 : 384 - 387 .

NOJOUMIAN M , STINSON D R , GRAINGER M . Unconditionally secure social secret sharing scheme [J ] . IET Information Security , 2010 , 4 ( 4 ): 202 .

GORDON S D , KATZ J . Rational secret sharing,revisited [C ] // Lecture Notes in Computer Science . Berlin:Springer , 2006 : 229 - 241 .

ABRAHAM I , DOLEV D , GONEN R , et al . Distributed computing meets game theory:robust mechanisms for rational secret sharing and multiparty computation [C ] // Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing . New York:ACM Press , 2006 : 53 - 62 .

MICALI S , SHELAT A . Purely rational secret sharing (extended abstract) [C ] // Theory of Cryptography . Berlin:Springer , 2009 : 54 - 71 .

ONG S J , PARKES D C , ROSEN A , et al . Fairness with an honest minority and a rational majority [C ] // Theory of Cryptography . Berlin:Springer , 2009 : 36 - 53 .

ZHANG Z F , LIU M L . Rational secret sharing as extensive games [J ] . Science China Information Sciences , 2013 , 56 ( 3 ): 1 - 13 .

SHAMIR A . How to share a secret [J ] . Communications of the ACM , 1979 , 22 ( 11 ): 612 - 613 .

STADLER M , . Publicly verifiable secret sharing [C ] // Advances in Cryptology — EUROCRYPT’96 . Berlin:Springer , 1996 : 190 - 199 .

浏览量

507

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于秘密共享的匿名举报者回复方案

基于秘密共享的轻量级隐私保护ViT推理框架

基于密码反馈秘密共享的大容量密文域可逆隐藏

基于移动端协助的远程用户单一口令认证方法

基于特征值的可验证特殊门限秘密共享方案