본문 바로가기
KERD
논문KCI 등재

Non-interactive identity-based DNF signature scheme and its extensions

이동훈|이광수|Jung Yeon Hwang
대한수학회 (The Korean Mathematical Society)|2009.07|대한수학회보 (Bulletin of the KMS)|제46권 제4호|pp. 743-769

1

조회

0

다운로드

1

인용

0

참고문헌

키워드

identity-based signaturedisjunctive normal formsigner anony-mityaccess structure
주제분류수학

초록

An ID-based DNF signature scheme is an ID-based signature scheme with an access structure which is expressed as a disjunctive normal form (DNF) with literals of signer identities. ID-based DNF signature schemes are useful to achieve not only signer-privacy but also a multi-user access control. In this paper, we formally define a notion of a (non-interactive) ID-based DNF signature and propose the first non-interactive ID-based DNF signature schemes that are secure under the computational Diffie-Hellman and subgroup decision assumptions. Our first scheme uses random oracles, and our second one is designed without random oracles. To construct the second one, we use a novel technique that converts a non-interactive witness indistinguishable proof system of encryption of one bit into a corresponding proof system of encryption of a bit-string. This technique may be of independent interest. The second scheme straightforwardly yields the first ID-based ring signature that achieves anonymity against full key exposure without random oracles. We finally present two extensions of the proposed ID-based DNF signature schemes to support multiple KGCs and different messages.

Abstract

An ID-based DNF signature scheme is an ID-based signature scheme with an access structure which is expressed as a disjunctive normal form (DNF) with literals of signer identities. ID-based DNF signature schemes are useful to achieve not only signer-privacy but also a multi-user access control. In this paper, we formally define a notion of a (non-interactive) ID-based DNF signature and propose the first non-interactive ID-based DNF signature schemes that are secure under the computational Diffie-Hellman and subgroup decision assumptions. Our first scheme uses random oracles, and our second one is designed without random oracles. To construct the second one, we use a novel technique that converts a non-interactive witness indistinguishable proof system of encryption of one bit into a corresponding proof system of encryption of a bit-string. This technique may be of independent interest. The second scheme straightforwardly yields the first ID-based ring signature that achieves anonymity against full key exposure without random oracles. We finally present two extensions of the proposed ID-based DNF signature schemes to support multiple KGCs and different messages.

참고문헌 (25)

  1. A. Beimel, "Secure schemes for secret sharing and key distribution", 박사, pp.1996
  2. M. Bellare, "Security proofs for identity-based identification and signature schemes, Advances in cryptology–EUROCRYPT 2004", Lecture Notes in Comput. Sci, 3027, pp.268~286 (2004), Springer
  3. A. Bender, "Ring signatures: Stronger definitions, and constructions without random oracles, In TCC 2006", Lecture Notes in Comput. Sci, 3876, pp.60~79 (2007), Springer-Verlang
  4. J. Bethencourt, "Ciphertext-policy attribute-based encryption", Proceedings of the IEEE Symposium on Security and Privacy, pp.321~334 (2007)
  5. D. Boneh, "Evaluating 2-DNF formulas on ciphertexts, Theory of cryptography", Lecture Notes in Comput. Sci, 3378, pp.325~341 (2005), Springer
  6. X. Boyen, "Mesh signatures: how to leak a secret with unwitting and unwilling participants, Advances in cryptology–EUROCRYPT 2007", Lecture Notes in Comput. Sci, 4515, pp.210~227 (2007), Springer
  7. E. Bresson, "Threshold ring signatures and applications to adhoc groups, Advances in cryptology–CRYPTO 2002", Lecture Notes in Comput. Sci, 2442, pp.465~480 (2002), Springer
  8. J. C. Cha, "An identity-based signature from gap Diffie-Hellman groups, Public key cryptography–PKC 2003", Lecture Notes in Comput. Sci, 2567, pp.18~30 (2002), Springer
  9. S. S. M. Chow, "Efficient identity based ring signature, ACNS 2005", Lecture Notes in Comput. Sci, 3531, pp.499~512 (2005), Springer-Verlang
  10. W. Diffe, "New directions in cryptography", IEEE Trans. Information Theory, IT-22(6), pp.644~654 (1976)
  11. C. Gentry, "Identity-based aggregate signatures, Public key cryptography– PKC 2006", Lecture Notes in Comput. Sci, 3958, pp.257~273 (2006), Springer
  12. V.Goyal, "Attribute based encryption for fine-graned access control of encrypted data", ACM conference on Computer and Communications Security (ACM CCS), pp.89~98 (2006)
  13. J. Groth, "Perfect non-interactive zero knowledge for NP, Advances in cryptology–EUROCRYPT 2006", Lecture Notes in Comput. Sci, 4004, pp.339~358 (2006), Springer
  14. J. Herranz, "New identity-based ring signature schemes, ICICS 2004", Lecture Notes in Comput. Sci, 3269, pp.27~39 (2004), Springer-Verlang
  15. F. Hess, "Efficient identity based signature schemes based on pairings, Selected areas in cryptography", Lecture Notes in Comput. Sci, 2595, pp.310~324 (2003), Springer
  16. Kwangsu Lee, "Non-interactive identity-based DNF signature scheme and its extensions", 대한수학회보, 46(4), pp.743~769 (2009), 대한수학회
  17. L. Nguyen, "Accumulators from bilinear pairings and applications, Topics in cryptology–CT-RSA 2005", Lecture Notes in Comput. Sci, 3376, pp.275~292 (2005), Springer
  18. R. Ostrovsky, "Attribute-based encryption with non-monotonic access structures", ACM conference on Computer and Communications Security (ACM CCS), pp.195~203 (2007)
  19. R. Rivest, "How to leak a secret, Advances in cryptology– ASIACRYPT 2001", Lecture Notes in Comput. Sci, 2248, pp.552~565 (2001), Springer
  20. A. Sahai, "Fuzzy identity-based encryption, Advances in cryptology– EUROCRYPT 2005", Lecture Notes in Comput. Sci, 3494, pp.457~473 (2005), Springer
  21. R. S. Sandhu, "Role-based access control models", IEEE Computer, 29(2), pp.38~47 (1996)
  22. H. Shacham, "Efficient ring signatures without random oracles, Public key cryptography–PKC 2007", Lecture Notes in Comput. Sci, 4450, pp.166~180 (2007), Springer
  23. A. Shamir, "Identity-based cryptosystems and signaure shcemes, CRYPTO 1984", Lecture Notes in Comput. Sci, 196, pp.47~53 (1984), Springer-Verlang
  24. B. Waters, "Efficient identity-based encryption without random oralces, EUROCRYPT 2005", Lecture Notes in Comput. Sci, 3494, pp.114~127 (2005), Springer-Verlang
  25. F. Zhang, "ID-based blind signature and ring signature from pairings, Advances in cryptology–ASIACRYPT 2002", Lecture Notes in Comput. Sci, 2501, pp.533~547 (2002), Springer

관련 논문AI추천

Generic Constructions for Strong Designated Verifier SignatureDeng-Guo Feng, Jing Xu, Wei-Dong Chen한국정보처리학회 · JIPS(Journal of Information Processing Systems)2011 · 제7권 제1호A lightweight verify revocable attribute-based ring signature schemeMridul KumarGupta, Saru Kumari, SHIVANI GOEL장전수학회 · Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집)2025 · 제28권 제4호Security Analysis of Two Certificateless Signature Schemes심경아, 이주희, 이향숙한국정보보호학회 · 정보보호학회논문지2009 · 제19권 제6호ID기반 온라인/오프라인 사인크립션(Signcryption) 기법구우권, 김기탁, 박승환, 이동훈한국정보보호학회 · 정보보호학회논문지2010 · 제20권 제5호Threshold Encryption Scheme based on Cocks' IBE Scheme김대엽, Sergey V. Bezzateev한국정보처리학회 · 정보처리학회논문지C2012 · 제19권 제4호On multi-authority ciphertext-policy attribute-based encryptionClaudia Eckert, Sascha Müller, Stefan Katzenbeisser대한수학회 · 대한수학회보2009 · 제46권 제4호

이 간행물의 다른 논문 (14건)

On the complex oscillation of higher order linear differential equationsLian-Zhong Yang, Kai Liupp. 607-615On complete convergence for weighted sums of i.i.d. random variables with application to moving average processesSoo Hak Sungpp. 617-626Optimal error estimate for semi-discrete gauge-Uzawa method for the Navier-Stokes equationsJae-Hong Pyopp. 627-644On the Hyers-Ulam-Rassias stability of Jensen's equationDongyan Zhang, Jian Wangpp. 645-656A structure theorem for complete intersections최은정, 고형준, Oh-Jin Kangpp. 657-671
원문 보기