Efficient and provably-secure identity-based signatures and signcryption from bilinear maps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3788 LNCS, Issue , 2005, Pages 515-532

  Barreto, Paulo S L M ^b   Libert, Benoît ^c   McCullagh, Noel ^a   Quisquater, Jean Jacques ^c  

^a DUBLIN CITY UNIVERSITY   (Ireland)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; MATHEMATICAL MODELS; RANDOM PROCESSES; SECURITY OF DATA;

COMPUTATIONAL ASSUMPTIONS; IDENTITY-BASED SIGNCRYPTION (IBSC); RANDOM ORACLE MODEL;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33646820668     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593447_28     Document Type: Conference Paper

References (39)

1. J.-H. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. In Eurocrypt'02, volume 2332 of LNCS, pages 83-107. Springer, 2002.
2. P. S. L. M. Barreto. The pairing based crypto lounge. http://planeta.terra.com.br/informatica/paulobarreto/pblounge.html.
3. P. S. L. M. Barreto, B. Lynn, and M. Scott. On the selection of pairing-friendly groups. In SAC'03, volume 3006 of LNCS, pages 17-25. Springer, 2003.
4. P. S. L. M. Barreto and M. Naehrig. Pairing-friendly elliptic curves of prime order. Cryptology ePrint Archive, Report 2005/133, 2005. http://eprint.iacr.org/2005/133.
5. M. Bellare, C. Namprempre, and G. Neven. Security proofs for identity-based identification and signature schemes. In Eurocrypt'04, volume 3027 of LNCS, pages 268-286. Springer, 2004.
6. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communications Security, pages 62-73, Fairfax, USA, 1993. ACM Press.
7. D. Boneh and X. Boyen. Efficient selective-ID secure identity based encryption without random oracles. In Eurocrypt'04, volume 3027 of LNCS, pages 223-238. Springer, 2004.
8. D. Boneh and X. Boyen. Secure identity based encryption without random oracles. In Crypto'04, volume 3152 of LNCS, pages 443-459. Springer, 2004.
9. D. Boneh and X. Boyen. Short signatures without random oracles. In Eurocrypt'04, volume 3027 of LNCS, pages 56-73. Springer, 2004.
10. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In Crypto'01, volume 2139 of LNCS, pages 213-229. Springer, 2001.
11. X. Boyen. Multipurpose identity-based signcryption: A Swiss army knife for identity-based cryptography. In Crypto'03, volume 2729 of LNCS, pages 383-399. Springer, 2003.
12. J. C. Cha and J. H. Cheon. An identity-based signature from gap Diffie-Hellman groups. In PKC'03, volume 2567 of LNCS, pages 18-30. Springer, 2003.
13. L. Chen and Z. Cheng. Security proof of Sakai-Kasahara's identity-based encryption scheme. Cryptology ePrint Archive, Report 2005/226, 2005. http://eprint.iacr.org/2005/226.
14. L. Chen and J. Malone-Lee. Improved identity-based signcryption. In PKC'05, volume 3386 of LNCS, pages 362-379. Springer, 2005.
15. J. H. Cheon, Y. Kim, and H. J. Yoon. A new id-based signature with batch verification. Cryptology ePrint Archive, Report 2004/131, 2004. http://eprint.iacr.org/2004/131.
16. S. S. M. Chow, S. M. Yiu, L. C. K. Hui, and K. P. Chow. Efficient forward and provably secure ID-based signcryption scheme with public verifiability and public ciphertext authenticity. In 6th International Conference on Information Security and Cryptology - ICISC'03, volume 2971 of LNCS, pages 352-369. Springer, 2003.
17. S. S. M. Chow, T. H. Yuen, L. C. K. Hui, and S. M. Yiu. Signcryption in hierarchical identity based cryptosystem. In 20th International Conference on Information Security (SEC'05). IFIP TC11, 2005.
18. C. Cocks. An identity based encryption scheme based on quadratic residues. In 8th IMA International Conference, volume 2260 of LNCS, pages 360-363. Springer, 2001.
19. Y. Dodis, J. Katz, S. Xu, and M. Yung. Strong key-insulated signature schemes. In PKC'03, volume 2567 of LNCS, pages 130-144. Springer, 2003.
20. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Crypto'86, volume 0263 of LNCS, pages 186-194. Springer, 1986.
21. C. Gentry and A. Silverberg. Hierarchical ID-based cryptography. In Asiacrypt'02, volume 2501 of LNCS, pages 548-566. Springer, 2002.
22. S. Goldwasser, S. Micali, and R. Rivers t. A digital signature scheme secure against adaptive chosen message attacks. SIAM Journal of Computing, 17(2):281-308, 1988.
23. L. Guillou and J.-J. Quisquater. A "paradoxical" identity-based signature scheme resulting from zero-knowledge. In Crypto'88, volume 0403 of LNCS, pages 216-231. Springer, 1988.
24. F. Heß. Efficient identity based signature schemes based on pairings. In SAC'02, volume 2595 of LNCS, pages 310-324. Springer, 2003.
25. K. Kurosawa and S.-H. Heng. Identity-based identification without random oracles. In ISH'05, LNCS. Springer, 2005. To appear.
26. B. Libert and J.-J. Quisquater. New identity based signcryption schemes from pairings. In IEEE Information Theory Workshop, Paris, France, 2003. http://eprint.iacr.org/2003/023.
27. J. Malone-Lee. Identity-based signcryption. Cryptology ePrint Archive, Report 2002/098, 2002. http://eprint.iacr.org/2002/098.
28. N. McCullagh and P. S. L. M. Barreto. Efficient and forward-secure identity-based signcryption. Cryptology ePrint Archive, Report 2004/117, 2004. http://eprint.iacr.org/2004/117.
29. A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals, E84-A(5):1234-1243, 2001.
30. D. Nalla and K. C. Reddy. Signcryption scheme for identity-based cryptosystems. Cryptology ePrint Archive, Report 2003/066, 2003. http://eprint.iacr.org/2003/066.
31. D. Pointcheval and J. Stern. Security proofs for signature schemes. In Eurocrypt'96, volume 1992 of LNCS, pages 387-398. Springer, 1996.
32. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361-396, 2000.
33. R. Sakai and M. Kasahara. ID based cryptosystems with pairing on elliptic curve. In SCIS'03, Hamamatsu, Japan, 2003. http://eprint.iacr.org/2003/054.
34. A. Shamir. Identity based cryptosystems and signature schemes. In Crypto'84, volume 0196 of LNCS, pages 47-53. Springer, 1984.
35. N. P. Smart and F. Vercauteren. On computable isomorphisms in efficient pairing based systems. Cryptology ePrint Archive, Report 2005/116, 2005. http://eprint.iacr.org/2005/116.
36. B. Waters. Efficient identity-based encryption without random oracles. In Eurocrypt'05, volume 3494 of LNCS, pages 114-127. Springer, 2005.
37. T. H. Yuen and V. K. Wei. Fast and proven secure blind identity-based signcryption from pairings. In CT-RSA '05, volume 3376 of LNCS, pages 305-322. Springer, 2003.
38. F. Zhang, R. Safavi-Naini, and W. Susilo. An efficient signature scheme from bilinear pairings and its applications. In PKC'04, volume 2947 of LNCS, pages 277-290. Springer, 2004.
39. Y. Zheng. Digital signcryption or how to achieve cost (signature & encryption) cost(signature) + cost(encryption). In Crypto'97, volume 1294 of LNCS, pages 165-179. Springer, 1997.