[1]李志敏,王励成,郑世慧,等.基于随机哈希签名模式的可信捐赠监督方案[J].东南大学学报(自然科学版),2009,39(4):733-737.[doi:10.3969/j.issn.1001-0505.2009.04.016]
 Li Zhimin,Wang Licheng,Zheng Shihui,et al.Trustable donation monitor schemes based on randomized Hash signature scheme[J].Journal of Southeast University (Natural Science Edition),2009,39(4):733-737.[doi:10.3969/j.issn.1001-0505.2009.04.016]
点击复制

基于随机哈希签名模式的可信捐赠监督方案()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
39
期数:
2009年第4期
页码:
733-737
栏目:
计算机科学与工程
出版日期:
2009-07-20

文章信息/Info

Title:
Trustable donation monitor schemes based on randomized Hash signature scheme
作者:
李志敏 王励成 郑世慧 杨义先
北京邮电大学网络与交换技术国家重点实验室信息安全中心,北京 100876; 北京邮电大学网络与信息攻防技术教育部重点实验室, 北京 100876; 北京邮电大学灾备技术国家工程实验室, 北京100876)
Author(s):
Li Zhimin Wang Licheng Zheng Shihui Yang Yixian
Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
Key Laboratory of Network and Information Attack and Defence Technology of Ministry of
关键词:
RMX随机哈希签名算法 百万富翁问题 计算复杂度 捐赠监督方案
Keywords:
RMX randomized Hash signature scheme millionaires’ problem computational complexity donation monitor scheme
分类号:
TP309.7
DOI:
10.3969/j.issn.1001-0505.2009.04.016
摘要:
通过修改随机数的选取方式,对 RMX随机哈希签名算法进行强化,使算法不需要假定签名者是诚实的. 基于该强化算法设计了2个可信的捐赠监督方案.当捐赠人愿意透露捐赠数额时,可构建出一个精确捐赠监督方案,任意2名捐赠人可通过比较彼此得到的捐赠总数来判断慈善机构是否公布出正确的捐赠总数.当捐赠人不方便透露捐款数额时,利用强化后的RMX签名算法和百万富翁问题设计了一个模糊捐赠监督方案,捐赠人同样可以监督慈善机构.分析结果表明,慈善机构作假和恶意捐赠人诬陷慈善机构的计算复杂度均为O(2n/22),其中n表示方案中使用的哈希函数输出散列值的长度.当n>160 bit时,方案在现有计算能力下是足够安全的.
Abstract:
An enhanced RMX randomized Hash signature scheme is developed through changing the elective mode of the random value, which does not need the presupposition that the signer should be honest. Based on the enhanced scheme, two trustable donation monitor schemes are put forward. When the donators agree to reveal the donations, an accurate donation monitor scheme can be proposed. Through comparing the received donations, any two donators can judge whether the charity proclaims the right total number of the donation or not. When the donators refuse to reveal the donations, an ambiguous donation monitor scheme is advanced based on the enhanced RMX scheme and the millionaires’ problem. And the donators also can supervise the charity. The analysis results demonstrate that the computation complexities with lying by the charity and forging by the evil donators are both O(2n/22), where n is the output length of the Hash function. Thus, these schemes are secure enough under the existing computer power when n>160 bit.

参考文献/References:

[1] Biham E,Chen R,Joux A,et al.Collisions of SHA-0 and reduced SHA-1 [C] //Advances in Cryptology-EUROCRYPT 2005.Berlin,Germany:Springer-Verlag,2005:36-57.
[2] Wang X,Lai X,Feng D,et al.Cryptanalysis of the hash functions MD4 and RIPEMD [C] //Advances in Cryptology-EUROCRYPT 2005.Berlin,Germany:Springer-Verlag,2005:1-18.
[3] Wang X,Yin Y L,Yu H.Efficient collision search attacks on SHA-0 [C] //Advances in Cryptology-CRYPTO 2005.Berlin,Germany:Springer-Verlag,2005:1-16.
[4] Wang X,Yin Y L,Yu H.Finding collisions in the full SHA-1 [C] //Advances in Cryptology-CRYPTO 2005.Berlin,Germany:Springer-Verlag,2005:17-36.
[5] Halevi S,Krawczyk H.Strengthening digital signatures via randomized hashing [C] //Advances in Cryptology-CRYPTO 2006.Berlin,Germany:Springer-Verlag,2006:41-59.
[6] National Institute of Standard and Technology.SP800—90 Recommendation for random number generation using deterministic random bit generators [S].New York,USA:US Department of Commerce,2007.
[7] Kelsey J,Schneier B.Second preimages on n-bit hash functions for much less than 2n work [C] //Advances in Cryptology-EUROCRYPT 2005.Berlin,Germany:Springer-Verlag,2005:474-490.
[8] 李顺东,戴一奇,游启友.姚氏百万富翁问题的高效解决方案[J].电子学报,2005,33(5):769-773.
  Li Shundong,Dai Yiqi,You Qiyou.An efficient solution to Yao’s millionaires’ problem [J]. Acta Electronica Sinica,2005,33(5):769-773.(in Chinese)

备注/Memo

备注/Memo:
作者简介: 李志敏(1981—),女,博士生; 杨义先(联系人),男,博士,教授,博士生导师,yxyang@bupt.edu.cn.
基金项目: 国家重点基础研究发展计划(973计划)资助项目(2007CB310704)、国家高技术研究发展计划(863计划)资助项目(2007AA01Z430)、 国家自然科学基金资助项目(90718001,60821001).
引文格式: 李志敏,王励成,郑世慧,等.基于随机哈希签名模式的可信捐赠监督方案[J].东南大学学报:自然科学版,2009,39(4):733-737.[doi:10.3969/j.issn.1001-0505.2009.04.016]
更新日期/Last Update: 2009-07-20