全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

格基在线/离线签名方案

DOI: 10.13190/j.jbupt.2015.03.020

Keywords: 在线/离线签名,基于身份的密码体制,,小整数解问题

Full-Text   Cite this paper   Add to My Lib

Abstract:

针对先前的签名方案实现的效率不足,提出了格基在线/离线签名方案.该方案分为离线/在线两个阶段,离线阶段在未知消息的情况下进行大量的预计算,在获知消息的情况之后在在线阶段进行少量的计算.该方案仅在在线阶段对消息进行签名.最后,在小整数解假设下证明了新方案具有抗适应性选择消息攻击的强不可伪造性.与现有的方案相比,新方案实现效率高,安全性强,更能满足实际的需求.

References

[1]  Even S, Goldreich O, Macali S. On-line/off-line digital signatures[C]//Proceedings of Advances in Cryptology: Crypto'89. California, USA: Springer-Verlag, 1990: 263-275.
[2]  Crutchfield C, Molnar D, Turner D. Generic on-line/off-line threshold signatures[C]//Proceedings of Public Key Cryptography. New York, USA: Springer-Verlag, 2006: 58-74.
[3]  Shamir A, Tauman Y. Improved online/offline signature schemes[C]//Proceedings of Advances in Cryptology. Santa Barbara, CA, USA: Springer-Verlag, 2001: 355-367.
[4]  Xu Shidi, Mu Yi, Susilo W, et al. Online/offline signatures and multisignatures for AVOD and DSR routing security[C]//ACISP'06. Melbourne, Australia: Springer-Verlag, 2006: 99-110.
[5]  Joseph K L, Baek J, Zhou Jianying, et al. Efficient online/offline identity-based signature for wireless sensor network[J]. International Journal of Information Security, 2010, 9(4): 287-296.
[6]  Yao A C-C, Zhao Yunlei. Online/offline signatures for low-power devices[J]. IEEE Transactions on Information Forensics and Security, 2013, 8(2): 283-294.
[7]  Hohenberger S, Waters B. Online/offline attribute-based encryption[C]. PKC'14, Melbourne, Australia: Springer-Verlag, 2014: 293-310.
[8]  Gentry C, Peikert C, Vaikuntanathan V. How to use a short basis: trapdoors for hard lattices and new cryptographic constructions[C]//STOC 2008. Victoria, British Columbia, Canada: Association for Computing Machinery, May 17-20, 2008: 197-206.
[9]  Cash D, Hofheinz D, Kiltz E, et al. Bonsai trees, or how to delegate a lattice basis[J]. Journal of Cryptology, 2012, 25(4): 601-639.
[10]  Agrawal S, Boneh D, Boyen X. Lattice basis delegation in fixed dimension and shorter ciphertext hierarchical IBE[C]//Crypto 2010. Santa Barbara, CA, USA: Springer-Verlag, 2010: 98-115.
[11]  Krawczyk H, Rabin T. Chameleon signatures[C]// NDSS'00. San Diego, CA, USA: The Internet Society, 2000: 143-154.
[12]  Chen Xiaofeng, Zhang Fangguo, Susilo W, et al. Identity-based chameleon hashing and signatures without key exposure[J]. Information Sciences, 2014, 265(5): 198-210.
[13]  Rückert M. Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles[C]// PQCrypto 2010. Darmstadt, Germany: Lecture Notes in Computer Science, Springer-Verlag, 2010, 6061: 182-200.
[14]  Bellare M, Neven G. Multi-signatures in the plain public-key model and a general forking lemma[C]//CCS 2006. October 30-November 3, Alexandria, VA, USA: Association for Computing Machinery, 2006: 390-399.
[15]  Xagawa K. Cryptography with lattices[EB/OL]. [2010-02-15].

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133