Earticle

초록

영어

In this paper, we propose a new efficient hierarchical identity based signature (HIBS) scheme. Our scheme can be proven probably secure based on a natural hardness assumption (i.e. h-exponent computational diffie-hellman problem (h-CDH)) in the standard model. Our scheme only requires three pairing computations in verification, which has no relations with the hierarchy. Our scheme has constant signature size, and the length of a user's private key is shrinking as the depth increases. Most importantly, our scheme is non-public-verifiable. Only the specified recipient can verify the signature, which is very important for some private communications.

목차

Abstract
 1. Introduction
 2. Preliminaries
  2.1. Bilinear Maps
  2.2. Outline of HIBS Scheme
  2.3. Complexity Assumption
  2.4. Security Notions of Existential Unforgeability
 3. The Construction of the New HIBS Scheme
 4. Security Analysis
  4.1. Correctness
  3.2. Security Proof of Existential Unforgeability
 5. Efficiency Analysis
 6. Conclusions
 Acknowledgements
 References

키워드

저자

• He Liu [ Institute of Information Science, Beijing Jiaotong University Beijing, 100044, P. R. China ]
• Sijia Wang [ Beijing Huada Infosec Technology Co.,Ltd Beijing, 100044, P. R. China ]
• Mangui Liang [ Institute of Information Science, Beijing Jiaotong University Beijing, 100044, P. R. China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605