Identity-based strong designate verifier signature over lattices

doi:10.1016/S1005-8885(14)60345-9

中国邮电高校学报(英文) ›› 2014, Vol. 21 ›› Issue (6): 52-60.doi: 10.1016/S1005-8885(14)60345-9

• Information Security • 上一篇下一篇

Identity-based strong designate verifier signature over lattices

王凤和¹,胡予濮²,王春晓¹

1. 山东建筑大学
2. 西安电子科技大学

收稿日期:2014-04-08 修回日期:2014-07-15 出版日期:2014-12-31 发布日期:2014-12-31
通讯作者: 王凤和 E-mail:xiao2166@126.com
基金资助:
国家自然科学青年基金;国家自然科学基金面上项目;山东省自然科学青年基金

Identity-based strong designate verifier signature over lattices

Received:2014-04-08 Revised:2014-07-15 Online:2014-12-31 Published:2014-12-31
Contact: Feng-He WANG E-mail:xiao2166@126.com

摘要/Abstract

摘要： 　The notion of the identity-based (id-based) strong designate verifier signature (SDVS) was extent to the lattice-based cryptography. The authors proposed an id-based SDVS scheme over lattices by using the basis delegation technical in fixed dimension. The proposed scheme is based on the hardness of the learning with errors (LWE) problem, and the unforgeability against adaptive chosen message and selective identity attack is based on the hardness of the short integer solution (SIS) problem in the random oracle model. If the parameters m, n and q are the same, the signature length of this scheme is only 3mlbq bits shorter than (3m+n) lb q bits which is the signature length of the known lattice-based SDVS scheme in the public key environment. As a result, the proposed scheme is not only id-based but also efficient about the signature length and the computation cost. Moreover, this article also proposed an id-based strong designate verifier ring signature (SDVRS) scheme based on the proposed SDVS scheme, which satisfies anonimity, unforgeability.

关键词: SDVS, lattice-based cryptography, id-based cryptography, Gaussian sample, SIS problem, LWE problem

Abstract: 　The notion of the identity-based (id-based) strong designate verifier signature (SDVS) was extent to the lattice-based cryptography. The authors proposed an id-based SDVS scheme over lattices by using the basis delegation technical in fixed dimension. The proposed scheme is based on the hardness of the learning with errors (LWE) problem, and the unforgeability against adaptive chosen message and selective identity attack is based on the hardness of the short integer solution (SIS) problem in the random oracle model. If the parameters m, n and q are the same, the signature length of this scheme is only 3mlbq bits shorter than (3m+n) lb q bits which is the signature length of the known lattice-based SDVS scheme in the public key environment. As a result, the proposed scheme is not only id-based but also efficient about the signature length and the computation cost. Moreover, this article also proposed an id-based strong designate verifier ring signature (SDVRS) scheme based on the proposed SDVS scheme, which satisfies anonimity, unforgeability.

Key words: SDVS, lattice-based cryptography, id-based cryptography, Gaussian sample, SIS problem, LWE problem

参考文献

1. Jakobsson M, Sako K, Impagliazzo R. Designated verifier proofs and their applications. Advances in Cryptology: Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT’96), May 12-16, 1996, Zaragoza, Spain. LNCS 1070. Berlin, Germany: Springer-Verlag, 1996: 143-154

2. Li Y, Susilo W, Mu Y, et al. Designated verifier signature: Definition, framework and new constructions. Ubiquitous Intelligence and Computing: Proceedings of the 4th International Conference on Ubiquitous Intelligence and Computing (UIC’07), Jul 11-13, 2007, Hong Kong, China. LNCS 4611.Berlin, Germany: Springer-Verlag, 2007: 1191-1200

3. Saeednia S, Kremer S, Markowitch O. An efficient strong designated verifier signature scheme. Information Security and Cryptology: Proceedings of the 6th International Conference on Information Security and Cryptology (ICISC’03), Nov 27-28, 2003, Seoul, Republic of Korea.LNCS 2971. Berlin, Germany: Springer-Verlag, 2003: 40-54

4. Raylin T, Okamoto T, Okamoto E. Practical strong designated verifier signature schemes based on double discrete logarithms. Information Security and Cryptology: Proceedings of the 8th International Conference on Information Security and Cryptology (ICISC’05), Dec 15-17, 2005, Beijing, China. LNCS 3935. Berlin, Germany: Springer-Verlag, 2005: 113-127

5. Shamir A, Identity-based cryptosystems and signature schemes. Advances in Cryptology: Proceedings of the 4th Annual International Cryptology Conference (Crypto’84), Aug 19-22, 1984, Santa Barbara, CA, USA. LNCS 196. Berlin, Germany: Springer-Verlag,1984: 47-53

6. Wu L, Li D X. Strong designated verifier ID-based ring signature scheme. Proceedings of the IEEE International Symposium on Information Science and Engineering (ISISE’08): Vol 1, Dec 20-22, 2008, Shanghai, China. Piscataway, NJ, USA: IEEE, 2008: 294-298

7. Kancharla P K, Gummadidala S, Saxena A. Identity based strong designated verifier signature scheme. Informatica, 2007,18(2): 239-252

8. Kang B Y, Boyd C, Dawson E. A novel identity-based strong designated verifier signature scheme. Journal of Systems and Software, 2009, 82(2): 270-273

9. Kang B Y, Boyd C, Dawson E. Identity-based strong designated verifier signature schemes: Attacks and new construction. Computers and Electrical Engineering, 2009, 35(1): 49-53

10. Shor P W. Polynomial-time algorithm for prime factorization and discrete logarithm on a quantum computer. SIAM Journal on Computing, 1997, 26(5): 1484-1509

11. Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC’08), May 17-20, 2008, Victoria, Canada. New York, NY, USA: ACM, 2008:197-206

12. Regev O. On lattice, learning with errors, random linear codes, and cryptography. Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC’ 05), May 22-24, 2005, Baltimore, MD, USA. New York, NY, USA: ACM, 2005: 84-89

13. Peikert C. Public-key cryptosystems from the worst-case shortest vector problem. Proceedings of the 41th Annual ACM Symposium on Theory of Computing (STOC’09), May 31-Jun 2, 2009, Bethesda, MD, USA. New York, NY, USA: ACM, 2009: 333-342

14. Cash D, Hofheinz D, Kiltz E, et al. Bonsai trees, or how to delegate a lattice basis. Advances in Cryptology: Proceedings of the 29th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’10), May 30-Jun 3, 2010, Nice, France. LNCS 6110. Berlin, Germany: Springer-Verlag, 2010: 523-552

15. Agrawal S, Boneh D, Boyen X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. Advances in Cryptology: Proceedings of the 30th Annual Cryptology Conference (CRYPTO’10), Aug 15-19, 2010, Santa Barbara, CA, USA. LNCS 6223. Berlin, Germany: Springer-Verlag, 2010: 98-115

16. Alwen J, Peikert C. Generating shorter bases for hard random lattices. Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS’09), Feb 26-28, 2009, Freiburg, Germany. 2009: 75-86

17. Gentry C, Halevi S, Vaikuntanathan V. A simple BGN-type cryptosystem from LWE. Advances in Cryptology: Proceedings of the 29th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’10), May 30-Jun 3, 2010, Nice, France. LNCS 6110. Berlin, Germany: Springer-Verlag, 2010: 506-522

18. Agrawal S, Boneh D, Boyen X. Efficient lattice (H) IBE in the standard model. Advances in Cryptology: Proceedings of the 29th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’10), May 30-Jun 3, 2010, Nice, France. LNCS 6110. Berlin, Germany: Springer-Verlag, 2010: 553-572

19. Wang F H, Hu Y P, Wang B C. Lattice-based strong designate verifier signature and its applications. Malaysian Journal of Computer Science, 2012, 25(1): 11-22

Identity-based strong designate verifier signature over lattices

Identity-based strong designate verifier signature over lattices

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

编辑推荐

Metrics

本文评价