An extensible cheat-proofing multi-secret sharing scheme with low computation complexity-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An extensible cheat-proofing multi-secret sharing scheme with low computation complexity

Published:2013-07-02 Issue:6 Volume:7 Page:1042-1048
ISSN:1939-0114
Container-title:Security and Communication Networks
language:en
Short-container-title:Security Comm. Networks

Author:

Wu Yinfeng¹,Huang Liping¹,Wang Xiao¹,Yu Ning¹

Affiliation:

1. School of Instrumentation Science and Opto-electronics Engineering; Beihang University; Beijing 100191 China

Publisher

Wiley

Subject

Computer Networks and Communications,Information Systems

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/sec.823/fullpdf

Reference19 articles.

1. Ito M Saito A Nishizeki T Secret sharing scheme realizing general access structure In Proc of IEEE Globecom 87 Tokyo IEEE Press 1987 99 102

2. How to share a secret;Shamir;Communication of the ACM,1979

3. Chor B Goldwasser S Micali S Awerbuch B verifiable secret sharing and achieving simultaneity in the presence of faults Proceedings of 26th IEEE symposium on foundations of computer science 1985 383 395

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Secure Multiparty Subset Computation;Security and Communication Networks;2017

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP