您当前的位置:
首页 >
文章列表页 >
The Optimal Information Rate of Quantum-Secret-Sharing Schemes Based on at Most Four Participants
更新时间:2025-07-16
    • The Optimal Information Rate of Quantum-Secret-Sharing Schemes Based on at Most Four Participants

    • Acta Electronica Sinica   Vol. 42, Issue 10, Pages: 1951-1956(2014)
    • DOI:10.3969/j.issn.0372-2112.2014.10.013    

      CLC: TP309
    • Published:2014

    移动端阅览

  • SONG Yun, LI Zhi-hui, LI Yong-ming. The Optimal Information Rate of Quantum-Secret-Sharing Schemes Based on at Most Four Participants[J]. Acta Electronica Sinica, 2014, 42(10): 1951-1956. DOI: 10.3969/j.issn.0372-2112.2014.10.013.

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

0

Views

2

下载量

6

CSCD

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

Related Articles

Master-Slave Multi-Chain Consensus Mechanism of Consortium Blockchain Based on Hypergraph and MuSig2
Bi-Graph Mix-random Walk Based Social Recommendation Model
Autoencoder and Hypergraph-Based Semi-Supervised Broad Learning System
A Secure Vector Space Secret Sharing Scheme

Related Author

LIU Zi-yu
JING Xu
WEN Jun-hao
RONG Wen-ge
FAN Qi-lin
YU Jun-liang
GAO Min
CAO Yang

Related Institution

Shaanxi Engineering Research Center of Agricultural Information Intelligent Perception and Analysis, Yangling
College of Information Engineering, Northwest A&F University, Yangling
School of Computer Science and Engineering, Beihang University
School of Information Technology and Electrical Engineering, University of Queensland
School of Big Data & Software Engineering, Chongqing University
0