|
|||||
|
|
| 抵御一般混合敌手的RSA可验证签名方案 | |
| 引用本文： | 黄丽伟,曹景龙,吕克伟.抵御一般混合敌手的RSA可验证签名方案[J].信息网络安全,2011(9):173-177. |
| 作者姓名： | 黄丽伟 曹景龙 吕克伟 |
| 作者单位： | 1. 首都师范大学数学科学学院,北京,100037 2. 北京经济干部管理学院信息系,北京,100015 3. 中科院研究生院信息安全国家重点实验室,北京,100049 |
| 基金项目： | 国家自然基金(no.60970154);国家重大研究计划"973"(no.2007CB311202)的支持 |
| 摘 要： | 对于可验证秘密分享,有一个简单的方法,如文献1],除了集合的交、并以及数的加减外,该方法几乎不涉及复杂的数学结构和子协议.文章利用该方法得到一个简单的可验证签名分享(V∑S).V∑S是由Franklin和Reiter3]1995年提出,可使得数字签名的接受者(并不一定是该签名的原来的签名者)在n个参与者中分享这个签... |
| 关 键 词： | 数字签名 混合型敌手 可验证签名分享 门限加密系统 |
RSA Verifiable Signature Sharing Scheme for General Mixed Access Structures |
|
| HUANG Li-wei,CAO Jing-long,LV Ke-wei.RSA Verifiable Signature Sharing Scheme for General Mixed Access Structures[J].Netinfo Security,2011(9):173-177. | |
| Authors: | HUANG Li-wei CAO Jing-long LV Ke-wei |
| Affiliation: | 3 ( 1. School of Mathematics, Capital Normal University, Beijing 100037, China 2. Dept. of Information, Beijing Institute of Economic Management, Beijing 100015, China 3. LOIS, Graduate University of Chinese Academy of Sciences, Beijing 100049, China ) |
| Abstract: | In this paper, we make use a very simple approach to verifiable secret sharing, which is based on essentially no mathematical structure or sophisticated sub-protocols except for intersections of sets and additions and multiplications of numbers, to construct a new RSA VZS scheme against the mixed （both active and passive） corruption on general （as opposed to threshold） adversary structures. VZS was introduced by Franklin and Reiter in 1995, enables the recipient of a digital signature who is not necessarily the original signer, to share that signature among n players so that a subset of them can later reconstruct it. Our protocol is well-suited for didactic purposes more since it is efficient and practical only for a small number of players. |
| Keywords: | Digital Signature Mixed Adversary Verifiable Signature Sharing Threshold Cryptosystem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
