您当前的位置:
首页 >
文章列表页 >
A Verifiable Rational Secret Sharing Scheme Based on Bilinear Pairing
更新时间:2025-07-16
    • A Verifiable Rational Secret Sharing Scheme Based on Bilinear Pairing

    • Acta Electronica Sinica   Vol. 40, Issue 5, Pages: 1050-1054(2012)
    • DOI:10.3969/j.issn.0372-2112.2012.05.031    

      CLC: TP309
    • Published:2012

    移动端阅览

  • ZHANG En, CAI Yong-quan. A Verifiable Rational Secret Sharing Scheme Based on Bilinear Pairing[J]. Acta Electronica Sinica, 2012, 40(5): 1050-1054. DOI: 10.3969/j.issn.0372-2112.2012.05.031.

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

2

下载量

10

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Heuristic Clustering Algorithm Based on Sub-Game Perfect Equilibrium
Sequential Three-Way Decision Model Based on the Game Between Uncertainty and Error Classification Rate
Common Channel Establishing Algorithms Based on Game Theory in Ad Hoc Cognitive Radio Networks
Game-Theoretic Analysis for the Secret Sharing Scheme

Related Author

CHANG Lu-yao
NIU Xin-zheng
LUO Tao
QIAN Zao-guo
ZHANG Qing-hua
HUANG Zhi-kang
GAO Man
AI Zhi-hua

Related Institution

School of Computer Science and Engineering, University of Electronics Science and Technology of China
Chongqing Key Laboratory of Computational Intelligence, Chongqing University of Posts and Telecommunications
Department of Electronic and Communication,Zhongshan University
China Telecom System Integration
School of Information and Communication Engineering, Beijing University of Posts and Telecommunication
0