Efficient revocable ID-based encryption with a public channel

Computer Journal

Volumn 55, Issue 4, 2012, Pages 475-486

  Tseng, Yuh Min ^a   Tsai, Tung Tso ^a  

^a NATIONAL CHANGHUA UNIVERSITY OF EDUCATION   (Taiwan)

Author keywords

ID based encryption; provable security; public key setting; revocation

Indexed keywords

BINARY TREE STRUCTURE; CERTIFICATE MANAGEMENT; CHOSEN CIPHERTEXT ATTACK; CHOSEN-PLAINTEXT ATTACK; COMPUTATION COSTS; CRITICAL ISSUES; DIFFIE-HELLMAN ASSUMPTION; ENCRYPTION AND DECRYPTION; ID-BASED; ID-BASED ENCRYPTION; PRIVATE KEY; PROVABLE SECURITY; PUBLIC KEY SETTINGS; PUBLIC-KEY ENCRYPTION; REVOCATION; SECURE CHANNELS; USER NEED;

COMPUTER SCIENCE;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84859342049     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxr098     Document Type: Article

References (39)

1. Shamir, A. (1984) Identity-Based Cryptosystems and Signature Schemes. Proc. CRYPTO'84, Santa Barbar, CA, August 19-22, pp. 47-53. Springer, Berlin.
2. Housley, R., Polk,W., Ford,W. and Solo, D. (2002) Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile. RFC 3280. IETF, CA.
3. Aiello, W., Lodha, S. and Ostrovsky, R. (1998) Fast Digital Identity Revocation. Proc. CRYPTO'98, Santa Barbara, CA, August 23-27, pp. 137-152. Springer, Berlin.
4. Elwailly, F.F., Gentry, C. and Ramzan, Z. (2004) QuasiModo: Efficient Certificate Validation and Revocation. Proc. PKC'04, Singapore, March 1-4, pp. 375-388. Springer, Berlin.
5. Gentry, C. (2003) Certificate-Based Encryption and the Certificate Revocation Problem. Proc. Eurocrypt'03, Warsaw, Poland, May 4-8, pp. 272-293. Springer, Berlin.
6. Goyal, V. (2007) Certificate Revocation Using Fine Grained Certificate Space Partitioning. Proc. FC'07, Scarborough, Tobago, February 12-15, pp. 247-259. Springer, Berlin.
7. Micali, S. (2002) Novomodo: Scalable Certificate Validation and Simplified PKI Management. Proc. 1st Annual PKI ResearchWorkshop, Gaithersburg, MD, April 24-25, pp. 15-25. NIST, MD.
8. Boneh, D. and Franklin, M. (2001) Identity-Based Encryption from the Weil Pairing. Proc. Crypto'01, Santa Barbara, CA, August 19-23, pp. 213-229. Springer, Berlin.
9. Bellare, M., Namprempre, C. and Neven, G. (2004) Security Proofs for Identity-Based Identification and Signature Schemes. Proc. Eurocrypt'04, Interlaken, Switzerland, May 2-6, pp. 268-286. Springer, Berlin.
10. Boneh, D. and Hamburg, M. (2008) Generalized Identity Based and Broadcast Encryption Schemes. Proc. Asiacrypt 2008, Melbourne, Australia, December 7-11, pp. 455-470. Springer, Berlin.
11. Brian J. (2009) Matt: Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures. Proc. PKC'09, Irvine, CA, March 18-20, pp. 337-356. Springer, Berlin.
12. Cha, J.C. and Cheon, J.H. (2003) An Identity-Based Signature from Gap Diffie-Hellman Groups. Proc. PKC'03, Miami, FL, January 6-8, pp. 18-30. Springer, Berlin.
13. Chen, L., Cheng, Z. and Smart, N.P. (2007) Identity-based key agreement protocols from pairings. Int. J. Inf. Secur., 6, 213-241.
14. Liu, J.K. and Zhou, J. (2009) An Efficient Identity-Based Online/Offline Encryption Scheme. Proc. ACNS'09, Paris, France, June 2-5, pp. 156-167. Springer, Berlin.
15. Tseng, Y.M., Wu, T.Y. and Wu, J.D. (2009) An efficient and provably secure ID-based signature scheme with batch verifications. Int. J. Innov. Comput., Inf. Control, 5, 3911-3922.
16. Wu, T.Y. and Tseng, Y.M. (2010) An ID-based mutual authentication and key exchange protocol for low-power mobile devices. Comput. J., 53, 1062-1070.
17. Wu, T.Y. and Tseng, Y.M. (2011) A pairing-based publicly verifiable secret sharing scheme. J. Syst. Sci. Complex., 24, 186-194.
18. Waters, B. (2005) Efficient Identity-Based Encryption Without Random Oracles. Proc. Eurocrypt'05, Aarhus, Denmark, May 22-26, pp. 114-127. Springer, Berlin.
19. Fan, C.I., Huang, L.Y. and Ho, P.H. (2010) Anonymous multireceiver identity-based encryption. IEEE Trans. Comput., 59, 1239-1249.
20. Boldyreva, A., Goyal, V. and Kumar, V. (2008) Identity-Based Encryption with Efficient Revocation. Proc. CCS'08,Alexandria, VA, October 27-31, pp. 417-426. ACM, NewYork.
21. Boneh, D., Ding, X., Tsudik, G. and Wong, C. M. (2001) A Method for Fast Revocation of Public Key Certificates and Security Capabilities. Proc. 10th USENIX Security Symp., Washington, August 13-17, pp. 297-310. USENIX Association, CA.
22. Baek, J. and Zheng, Y. (2004) Identity-Based Threshold Decryption. Proc. PKC'04, Singapore, March 1-4, pp. 262-276. Springer, Berlin.
23. Ding, X. and Tsudik, G. (2003) Simple Identity-Based Cryptography with Mediated RSA. Proc. CT-RSA'03, San Francisco, CA, April 13-17, pp. 193-210. Springer, Berlin.
24. Ju, H.S., Kim, D.Y., Lee, D.H., Park, H. and Chun, K. (2006) Modified ID-Based Threshold Decryption and its Application to Mediated Id-Based Encryption. Proc. APWeb2006, Harbin, China, January 16-18, pp. 720-725. Springer, Berlin.
25. Libert, B. and Quisquater, J.J. (2003) Efficient Revocation and Threshold Pairing Based Cryptosystems. Proc. PODC2003, Boston, MA, July 13-16, pp. 163-171. ACM, NewYork.
26. Wan, Z. M., Weng, J., Lai, X.J., Liu, S.L. and Li, J.G. (2011) On the relation between identity-based proxy re-encryption and mediated identity-based encryption. J. Inf. Sci. Eng., 27, 243-259.
27. Canetti, R., Halevi, S. and Katz, J. (2003) A Forward-Secure Public-Key Encryption Scheme. Proc. Eurocrypt'03, Warsaw, Poland, May 4-8, pp. 255-271. Springer, Berlin.
28. Libert, B. and Vergnaud, D. (2009) Adaptive-ID Secure Revocable Identity-Based Encryption. Proc. CT-RSA'09, San Francisco, CA, February 14-18, pp. 1-15. Springer, Berlin.
29. Sakai, R. and Kasahara, M. (2003) ID-Based Cryptosystems with Pairing on Elliptic Curve. Cryptology ePrint Archive, Report 2003/54. IACR.
30. Galbraith, S., Paterson, K. and Smart, N.P. (2008) Pairings for cryptographers. Discrete Appl. Math., 156, 3113-3121.
31. Bellare, M. and Rogaway, P. (1993) Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. Proc. CCS'93, Fairfax, VA, November 3-5, pp. 62-73. ACM, NewYork.
32. Canetti, R., Goldreich, O. and Halevi, S. (2004) The random oracle methodology, revisited. J. ACM, 51, 557-594.
33. Coron, J.S. (2000) On the Exact Security of Full Domain Hash. Proc. Crypto'00, Santa Barbara, CA,August 20-24, pp. 229-235. Springer, Berlin.
34. Fujisaki, E. and Okamoto, T. (1999) Howto Enhance the Security of Public-Key Encryption at Minimum Cost. Proc. PKC'99, Kamakura, Japan, March 1-3, pp. 53-68. Springer, Berlin.
35. Kitagawa, T.,Yang, P., Hanaoka, G., Zhang, R., Matsuura, K. and Imai, H. (2006) Generic Transforms to Acquire CCA-Security for Identity Based Encryption: The Cases of FOPKC and REACT. Proc. ACISP 2006, Melbourne, Australia, July 3-5, pp. 348-359. Springer, Berlin.
36. Scott M. (2005) Computing the Tate Pairing. Proc. CT-RSA'05, San Francisco, CA, February 14-18, pp. 293-304. Springer, Berlin.
37. Cao, X., Zeng, X., Kou, W. and Hu, L. (2009) Identity-based anonymous remote authentication for value-added services in mobile networks. IEEE Trans. Veh. Technol., 58, 3508-3517.
38. Wu, T.Y. and Tseng,Y.M. (2010) An efficient user authentication and key exchange protocol for mobile client-server environment. Comput. Netw., 54, 1520-1530.
39. Miracl library, Shamus Software Ltd. http://www.shamus.ie/ index.php?page=home.