• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Ge Lirong, Yu Jia, Cheng Xiangguo, Hao Rong, Zhao Huiyan, Li Meng. Strong Key-Insulated Signature Scheme Supporting Multi-Helpers in the Standard Model[J]. Journal of Computer Research and Development, 2014, 51(5): 1081-1088.
Citation: Ge Lirong, Yu Jia, Cheng Xiangguo, Hao Rong, Zhao Huiyan, Li Meng. Strong Key-Insulated Signature Scheme Supporting Multi-Helpers in the Standard Model[J]. Journal of Computer Research and Development, 2014, 51(5): 1081-1088.

Strong Key-Insulated Signature Scheme Supporting Multi-Helpers in the Standard Model

More Information
  • Published Date: May 14, 2014
  • Key-insulated signature is an important technique for protecting the signing secret keys. In key-insulated signature schemes, the security of the rest of the periods are unaffected even if a signing key of a time period is exposed. Parallel key-insulated signature schemes normally allow two helpers to help the signer update temporary private keys to strengthen the security. When two helper keys and any temporary private key are exposed simultaneously, the adversary can forge the correct signature of any time. In order to enhance the security of signature scheme, a new strong key-insulated signature scheme supporting n(n>2) helper devices is proposed. In the proposed scheme, if the user changes the frequency of updating temporary private keys to n times, the chance of exposing helper key still keeps the same as the original key-insulated system. As a result, it will not increase the chance of exposing the helper keys to insecure environment and will decrease the damage caused by key exposure. Finally, the scheme is proved secure based on the computation Diffie-Hellman assumption in the standard model.
  • Related Articles

    [1]Chen Yewang, Shen Lianlian, Zhong Caiming, Wang Tian, Chen Yi, Du Jixiang. Survey on Density Peak Clustering Algorithm[J]. Journal of Computer Research and Development, 2020, 57(2): 378-394. DOI: 10.7544/issn1000-1239.2020.20190104
    [2]Wang Haiyan, Xiao Yikang. Dynamic Group Discovery Based on Density Peaks Clustering[J]. Journal of Computer Research and Development, 2018, 55(2): 391-399. DOI: 10.7544/issn1000-1239.2018.20160928
    [3]Fan Zhiqiang and Zhao Qinping. A Data-Clustering Based Robust SIFT Feature Matching Method[J]. Journal of Computer Research and Development, 2012, 49(5): 1123-1129.
    [4]Yu Canling, Wang Lizhen, and Zhang Yuanwu. An Enhancement Algorithm of Cluster Boundaries Precision Based on Grid's Density Direction[J]. Journal of Computer Research and Development, 2010, 47(5): 815-823.
    [5]Ma Haitao, Hao Zhongxiao, Zhu Yan. Checking Active XML Validation[J]. Journal of Computer Research and Development, 2008, 45(9): 1554-1560.
    [6]Chen Jianmei, Lu Hu, Song Yuqing, Song Shunlin, Xu Jing, Xie Conghua, Ni Weiwei. A Possibility Fuzzy Clustering Algorithm Based on the Uncertainty Membership[J]. Journal of Computer Research and Development, 2008, 45(9): 1486-1492.
    [7]Lü Zonglei, Wang Jiandong, Li Ying, and Zai Yunfeng. An Index of Cluster Validity Based on Modal Logic[J]. Journal of Computer Research and Development, 2008, 45(9): 1477-1485.
    [8]Jin Jun and Zhang Daoqiang. Semi-Supervised Robust On-Line Clustering Algorithm[J]. Journal of Computer Research and Development, 2008, 45(3): 496-502.
    [9]Ding Shifei, Shi Zhongzhi, Jin Fengxiang, Xia Shixiong. A Direct Clustering Algorithm Based on Generalized Information Distance[J]. Journal of Computer Research and Development, 2007, 44(4): 674-679.
    [10]Yue Shihong, Wang Zhengyou. Bisecting Grid-Based Clustering Approach and Its Validity[J]. Journal of Computer Research and Development, 2005, 42(9): 1505-1510.

Catalog

    Article views (693) PDF downloads (518) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return