http://iet.metastore.ingenta.com
1887

Efficient identity-based blind message recovery signature scheme from pairings

Efficient identity-based blind message recovery signature scheme from pairings

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Blind signature (BS) schemes are a vital tool to design electronic cash (e-cash), online transaction, electronic voting (e-voting), digital right management (DRM) systems etc. The communication systems designed for such applications need small size and more confidential signature schemes. This article presents the first provably secure and efficient identity-based message recovery BS scheme from pairing. Since, in this scheme, the message is not transmitted with signature and recovered during verification phase, the total message–signature length is the lowest. Due to the blindness, the scheme provides authentication along with anonymity. The performance comparison shows that the authors' scheme consumes the lowest computation cost. Thus, it inspires the energy efficient (green) technology as well as is the most appealing BS scheme towards applications such as e-cash, e-voting, DRM systems etc. using low bandwidth and high security.

References

    1. 1)
      • J. Diaz , S.G. Choi , D. Arroyo . (2015)
        1. Diaz, J., Choi, S.G., Arroyo, D., et al: ‘Privacy Threats in E-Shopping (Position Paper)’. In Garcia-Alfaro, J., Navarro-Arribas, G., Aldini, A., Martinelli, F., Suri, N. (Eds.): ‘Lecture Notes in Computer Science’ vol 9481, (Springer, Cham, 2015).
        .
    2. 2)
      • W. Buhse .
        2. Buhse, W.: ‘Digital rights management for music filesharing communities’. AMCIS 2001 Proc., 2001, p. 296.
        . AMCIS 2001 Proc. , 296
    3. 3)
      • A. Ruiz-Martínez , Ó.C. Reverte , A.F. Gómez-Skarmeta .
        3. Ruiz-Martínez, A., Reverte, Ó.C., Gómez-Skarmeta, A.F.: ‘Payment frameworks for the purchase of electronic products and services’, Comput. Stand. Interfaces, 2012, 34, (1), pp. 8092.
        . Comput. Stand. Interfaces , 1 , 80 - 92
    4. 4)
      • D. Chaum , A. Fiat , M. Naor .
        4. Chaum, D., Fiat, A., Naor, M.: ‘Untraceable electronic cash’. Proc. on Advances in Cryptology, 1990 (LNCS, 403), pp. 319327.
        . Proc. on Advances in Cryptology , 319 - 327
    5. 5)
      • T.S. Messerges , E.A. Dabbish .
        5. Messerges, T.S., Dabbish, E.A.: ‘Digital rights management in a 3G mobile phone and beyond’. Proc. Third ACM Workshop on Digital Rights Management, 2003, pp. 2738.
        . Proc. Third ACM Workshop on Digital Rights Management , 27 - 38
    6. 6)
      • G. Taban , A.A. Cárdenas , V.D. Gligor .
        6. Taban, G., Cárdenas, A.A., Gligor, V.D.: ‘Towards a secure and interoperable DRM architecture’. Proc. ACM Workshop on Digital Rights Management, 2006, pp. 6978.
        . Proc. ACM Workshop on Digital Rights Management , 69 - 78
    7. 7)
      • W.-S. Juang .
        7. Juang, W.-S.: ‘A practical anonymous payment scheme for electronic commerce’, Comput. Math. Appl., 2003, 46, (12), pp. 17871798.
        . Comput. Math. Appl. , 12 , 1787 - 1798
    8. 8)
      • M.-H. Lin , C.-C. Chang , Y.-R. Chen .
        8. Lin, M.-H., Chang, C.-C., Chen, Y.-R.: ‘A fair and secure mobile agent environment based on blind signature and proxy host’, Comput. Secur., 2004, 23, (3), pp. 199212.
        . Comput. Secur. , 3 , 199 - 212
    9. 9)
      • D. Chaum .
        9. Chaum, D.: ‘Blind signatures for untraceable payments’. Crypto 82 Plennum, 1983 (LNCS, 1440), pp. 199203.
        . Crypto 82 Plennum , 199 - 203
    10. 10)
      • S. Von Solms , D. Naccache .
        10. Von Solms, S., Naccache, D.: ‘On blind signatures and perfect crimes’, Comput. Secur., 1992, 11, (6), pp. 581583.
        . Comput. Secur. , 6 , 581 - 583
    11. 11)
      • M. Stadler , J.-M. Piveteau , J. Camenisch .
        11. Stadler, M., Piveteau, J.-M., Camenisch, J.: ‘Fair blind signatures’. Advances in Cryptology—Eurocrypt 1995, 1995 (LNCS, 921), pp. 209219.
        . Advances in Cryptology—Eurocrypt 1995 , 209 - 219
    12. 12)
      • A. Boldyreva .
        12. Boldyreva, A.: ‘Efficient threshold signature, multi signature and blind signature schemes based on gap Diffey-Hellman group signature scheme’. PKC 2003, 2003 (LNCS, 2567), pp. 3146.
        . PKC 2003 , 31 - 46
    13. 13)
      • G.K. Verma , B. Singh .
        13. Verma, G.K., Singh, B.: ‘Efficient message recovery proxy blind signature scheme from pairings’, Trans. Emerg. Telecommun. Technol., 2017, 28, (11), p. e3167.
        . Trans. Emerg. Telecommun. Technol. , e3167
    14. 14)
      • G.K. Verma , B.B. Singh .
        14. Verma, G.K., Singh, B.B.: ‘New ID based fair blind signatures’. Int. J. Current Eng. Sci. Res., 2016, 3, (1), pp. 4147.
        . Int. J. Current Eng. Sci. Res. , 1 , 41 - 47
    15. 15)
      • W. Diffie , M.E. Hellman .
        15. Diffie, W., Hellman, M.E.: ‘New directions in cryptography’, IEEE Trans. Inf. Theory, 1976, 22, (6), pp. 644654.
        . IEEE Trans. Inf. Theory , 6 , 644 - 654
    16. 16)
      • R.L. Rivest , A. Shamir , L. Adleman .
        16. Rivest, R.L., Shamir, A., Adleman, L.: ‘A method for obtaining digital signatures and public-key cryptosystems’, Commun. ACM, 1978, 21, (2), pp. 120126.
        . Commun. ACM , 2 , 120 - 126
    17. 17)
      • A. Shamir .
        17. Shamir, A.: ‘Identity-based cryptosystems and signature schemes’. CRYPTO-84, 1985 (LNCS, 196), pp. 4753.
        . CRYPTO-84 , 47 - 53
    18. 18)
      • S.D. Galbraith , K. Harrison , D. Soldera .
        18. Galbraith, S.D., Harrison, K., Soldera, D.: ‘Implementing the Tate pairing’. Algorithmic number theory, 2002 (LNCS, 2369), pp. 324337.
        . Algorithmic number theory , 324 - 337
    19. 19)
      • N. Koblitz , A. Menezes , S. Vanstone .
        19. Koblitz, N., Menezes, A., Vanstone, S.: ‘The state of elliptic curve cryptography’, Des. Codes Cryptogr., 2000, 19, (2), pp. 173193.
        . Des. Codes Cryptogr. , 2 , 173 - 193
    20. 20)
      • D. He , J. Chen , J. Hu .
        20. He, D., Chen, J., Hu, J.: ‘Identity-based digital signature scheme without bilinear pairings’, Int. Assoc. Cryptol. Res. Cryptol. ePrint Arch., 2011, 2011, p. 79.
        . Int. Assoc. Cryptol. Res. Cryptol. ePrint Arch. , 79
    21. 21)
      • K.G. Paterson , J.C. Schuldt .
        21. Paterson, K.G., Schuldt, J.C.: ‘Efficient identity-based signatures secure in the standard model’. Information Security and Privacy, 2006 (LNCS, 4058), pp. 207222.
        . Information Security and Privacy , 207 - 222
    22. 22)
      • F. Zhang , K. Kim .
        22. Zhang, F., Kim, K.: ‘ID-based blind signature and ring signature from pairings’. ASIACRYPT-2002, 2002 (LNCS, 2501), pp. 533547.
        . ASIACRYPT-2002 , 533 - 547
    23. 23)
      • F. Zhang , K. Kim .
        23. Zhang, F., Kim, K.: ‘ID-based blind signature and ring signature from pairings’. ASIACRYPT ‘Efficient ID-based blind signature and proxy signature from bilinear pairings’ (ACISP-03), 2003 (LNCS, 2727), pp. 312323.
        . ASIACRYPT ‘Efficient ID-based blind signature and proxy signature from bilinear pairings’ (ACISP-03) , 312 - 323
    24. 24)
      • Z. Huang , K. Chen , Y. Wang .
        24. Huang, Z., Chen, K., Wang, Y.: ‘Efficient identity-based signatures and blind signatures’. Int. Conf. on Cryptology and Network Security, 2005 (LNCS, 3810), pp. 120133.
        . Int. Conf. on Cryptology and Network Security , 120 - 133
    25. 25)
      • J. Mao .
        25. Mao, J.: ‘Linkability analysis of some blind signature schemes’. Int. Conf. on Computational and Information Science, 2006 (LNCS, 4456), pp. 556566.
        . Int. Conf. on Computational and Information Science , 556 - 566
    26. 26)
      • S. Kalkan , K. Kaya , A.A. Selçuk .
        26. Kalkan, S., Kaya, K., Selçuk, A.A.: ‘Generalized ID-based blind signatures from bilinear pairings’. 23rd Int. Symp. on Computer and Information Sciences, 2008 (ISCIS'08), 2008, pp. 16.
        . 23rd Int. Symp. on Computer and Information Sciences, 2008 (ISCIS'08) , 1 - 6
    27. 27)
      • W. Gao , G. Wang , X. Wang .
        27. Gao, W., Wang, G., Wang, X., et al: ‘One-round ID-based blind signature scheme without ROS assumption’. Pairing-Based Cryptography-Pairing 2008, 2008 (LNCS, 5209), pp. 316331.
        . Pairing-Based Cryptography-Pairing 2008 , 316 - 331
    28. 28)
      • C.-P. Schnorr .
        28. Schnorr, C.-P.: ‘Security of blind discrete log signatures against interactive attacks’. Int. Conf. on Information and Communication System, 2001, vol. 1, pp. 112.
        . Int. Conf. on Information and Communication System , 1 - 12
    29. 29)
      • S.S. Chow .
        29. Chow, S.S.: ‘Blind signature and ring signature schemes: rehabilitation and attack’, Comput. Stand. Interfaces, 2009, 31, (4), pp. 707712.
        . Comput. Stand. Interfaces , 4 , 707 - 712
    30. 30)
      • R. Shakerian , T.M. Pour , S.H. Kamali .
        30. Shakerian, R., Pour, T.M., Kamali, S.H., et al: ‘An identity based public key cryptography blind signature scheme from bilinear pairings’. 2010 Third IEEE Int. Conf. on Computer Science and Information Technology (ICCSIT), 2010, vol. 7, pp. 2832.
        . 2010 Third IEEE Int. Conf. on Computer Science and Information Technology (ICCSIT) , 28 - 32
    31. 31)
      • B.U. Rao , K. Ajmath , P.V. Reddy .
        31. Rao, B.U., Ajmath, K., Reddy, P.V., et al: ‘An ID-based blind signature scheme from bilinear pairings’, Int. J. Comput. Sci. Secur. (IJCSS), 2010, 4, (1), p. 98.
        . Int. J. Comput. Sci. Secur. (IJCSS) , 1 , 98
    32. 32)
      • C.-I. Fan , W.-Z. Sun , V.S.-M. Huang .
        32. Fan, C.-I., Sun, W.-Z., Huang, V.S.-M.: ‘Provably secure randomized blind signature scheme based on bilinear pairing’, Comput. Math. Appl., 2010, 60, (2), pp. 285293.
        . Comput. Math. Appl. , 2 , 285 - 293
    33. 33)
      • G. Xu , G. Xu .
        33. Xu, G., Xu, G.: ‘An ID-based blind signature from bilinear pairing with unlinkability’. 2013 Third Int. Conf. on Consumer Electronics, Communications and Networks (CECNet), 2013, pp. 101104.
        . 2013 Third Int. Conf. on Consumer Electronics, Communications and Networks (CECNet) , 101 - 104
    34. 34)
      • S.H. Islam , M.S. Obaidat .
        34. Islam, S.H., Obaidat, M.S.: ‘Design of provably secure and efficient certificateless blind signature scheme using bilinear pairing’, Secur. Commun. Netw., 2015, 8, pp. 43194332.
        . Secur. Commun. Netw. , 4319 - 4332
    35. 35)
      • F. Zhang , W. Susilo , Y. Mu .
        35. Zhang, F., Susilo, W., Mu, Y.: ‘Identity-based partial message recovery signatures (or how to shorten ID-based signatures)’. Financial Cryptography and Data Security, 2005 (LNCS, 3570), pp. 4556.
        . Financial Cryptography and Data Security , 45 - 56
    36. 36)
      • Z. Wang , H. Chen .
        36. Wang, Z., Chen, H.: ‘A practical identity-based signature scheme from bilinear map’. Emerging Directions in Embedded and Ubiquitous Computing, 2007 (LNCS, 4809), pp. 704715.
        . Emerging Directions in Embedded and Ubiquitous Computing , 704 - 715
    37. 37)
      • R. Tso , C. Gu , T. Okamoto .
        37. Tso, R., Gu, C., Okamoto, T., et al: ‘An efficient ID-based digital signatures with message recovery’. Cryptology and Network Security, 2007 (LNCS, 4856), pp. 4759.
        . Cryptology and Network Security , 47 - 59
    38. 38)
      • M.R. Asaar , M. Salmasizadeh , W. Susilo .
        38. Asaar, M.R., Salmasizadeh, M., Susilo, W.: ‘A short ID-based proxy signature scheme’, Int. J. Commun. Syst., 2016, 29, (5), pp. 859873.
        . Int. J. Commun. Syst. , 5 , 859 - 873
    39. 39)
      • H. Singh , G.K. Verma .
        39. Singh, H., Verma, G.K.: ‘ID-based proxy signature scheme with message recovery’, J. Syst. Softw., 2012, 85, (1), pp. 209214.
        . J. Syst. Softw. , 1 , 209 - 214
    40. 40)
      • F. Wu , L. Xu .
        40. Wu, F., Xu, L.: ‘An improved and provable self-certified digital signature scheme with message recovery’, Int. J. Commun. Syst., 2015, 28, (2), pp. 344357.
        . Int. J. Commun. Syst. , 2 , 344 - 357
    41. 41)
      • H.M. Elkamchouchi , Y. Abouelseoud .
        41. Elkamchouchi, H.M., Abouelseoud, Y.: ‘A new blind identity-based signature scheme with message recovery’, IACR Cryptol. ePrint Arch., 2008, 2008, p. 038.
        . IACR Cryptol. ePrint Arch. , 038
    42. 42)
      • H.M. Elkamchouchi , Y. Abouelseoud .
        42. Elkamchouchi, H.M., Abouelseoud, Y.: ‘A new blind identity-based signature scheme with message recovery’, IACR Cryptology ePrint Archive, (2010) A New Blind Identity-Based Signature Scheme with Message Recovery. OJEEE, available at http://www.infomesr.org/attachments/W09-0037.pdf, 2, (2), pp. 200205.
        . , 2 , 200 - 205
    43. 43)
      • J.-L. Tsai .
        43. Tsai, J.-L.: ‘A new efficient certificateless short signature scheme using bilinear pairing’, IEEE Syst. J., 2015, 99, pp. 18.
        . IEEE Syst. J. , 1 - 8
    44. 44)
      • A. Karati , G.P. Biswas .
        44. Karati, A., Biswas, G.P.: ‘Cryptanalysis and improvement of a certificateless short signature scheme using bilinear pairing’. Proc. Int. Conf. on Advances in Information Communication Technology & Computing (AICTC ’16), New York, NY, USA, ACM, 2016, pp. 19:119:6.
        . Proc. Int. Conf. on Advances in Information Communication Technology & Computing (AICTC ’16) , 19:1 - 19:6
    45. 45)
      • S. Mitsunari , R. Sakai , M. Kasahara .
        45. Mitsunari, S., Sakai, R., Kasahara, M.: ‘A new traitor tracing’, IEICE Trans. Fundam. Electron., Commun. Comput. Sci., 2002, 85, (2), pp. 481484.
        . IEICE Trans. Fundam. Electron., Commun. Comput. Sci. , 2 , 481 - 484
    46. 46)
      • D. Pointcheval , J. Stern .
        46. Pointcheval, D., Stern, J.: ‘Security arguments for digital signatures and blind signatures’, J. Cryptol., 2000, 13, (3), pp. 361396.
        . J. Cryptol. , 3 , 361 - 396
    47. 47)
      • A. Juels , M. Luby , R. Ostrovsky .
        47. Juels, A., Luby, M., Ostrovsky, R.: ‘Security of blind digital signatures’. Advances in Cryptology–CRYPTO'97, 1997 (LNCS, 1294), pp. 150164.
        . Advances in Cryptology–CRYPTO'97 , 150 - 164
    48. 48)
      • S. Goldwasser , S. Micali , R.L. Rivest .
        48. Goldwasser, S., Micali, S., Rivest, R.L.: ‘A digital signature scheme secure against adaptive chosen-message attacks’, SIAM J. Comput., 1988, 17, (2), pp. 281308.
        . SIAM J. Comput. , 2 , 281 - 308
    49. 49)
      • Y.S. Rao , R. Dutta .
        49. Rao, Y.S., Dutta, R.: ‘Bandwidth-efficient attribute-based key-insulated signatures with message recovery’, Inf. Sci., 2016, 369, pp. 648673.
        . Inf. Sci. , 648 - 673
    50. 50)
      • 50. (2010) The Certicome Corporation, SEC 2: Recommended Elliptic Curve Domain Parameters.
        .
    51. 51)
      • X. Hu , J. Wang , Y. Yang .
        51. Hu, X., Wang, J., Yang, Y.: ‘Secure ID-based blind signature scheme without random oracle’. 2011 Int. Conf. on Network Computing and Information Security (NCIS), 2011, vol. 1, pp. 245249.
        . 2011 Int. Conf. on Network Computing and Information Security (NCIS) , 245 - 249
    52. 52)
      • 52. (2010) Shamus Software Ltd., MIRACL Library.
        .
    53. 53)
      • P. Barreto , H.Y. Kim , B. Lynn .
        53. Barreto, P., Kim, H.Y., Lynn, B., et al: ‘Efficient algorithms for pairing-based cryptosystems’. Crypto-2002, 2002, vol. 2, pp. 354368, Springer.
        . Crypto-2002 , 354 - 368
    54. 54)
      • N. Koblitz . (1994)
        54. Koblitz, N.: ‘Introduction to number theory and cryptography’ (Springer verlag, Berlin, Germany, 1994).
        .
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2017.0342
Loading

Related content

content/journals/10.1049/iet-ifs.2017.0342
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address