Scholarlink

<p>Nowadays, most of the business activities are performed via online transactions. So it is extremely important to protect the personal information of the individuals involved in online transactions. For this purpose, a well-known cryptographic primitive blind signature (BS) scheme is used since it hides the specific content of the signature. In this paper, we propose a novel identity-based BS (IBBS) scheme based on group ring. We show that our IBBS is secure in the standard model (STM) rather than the random oracle model (ROM), since any scheme that is secure in the ROM may be vulnerable to various attacks in real-world applications. Precisely, we show that our IBBS is secure in the STM (even in quantum word) if the generalized computational Diffie–Hellman problem is hard. We compare our IBBS with several other BS schemes and show that our scheme is suitable for online transactions due to its small signature size and computational efficiency since it requires only three pairing operations.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A novel and provably secure identity-based blind signature scheme for online transactions

  • 期刊论文

  • 发表日期：

    2025年3月19日

查看全文
  • Sunil Kumar,
  • Gaurav Mittal,
  • Arvind Yadav

摘要

Nowadays, most of the business activities are performed via online transactions. So it is extremely important to protect the personal information of the individuals involved in online transactions. For this purpose, a well-known cryptographic primitive blind signature (BS) scheme is used since it hides the specific content of the signature. In this paper, we propose a novel identity-based BS (IBBS) scheme based on group ring. We show that our IBBS is secure in the standard model (STM) rather than the random oracle model (ROM), since any scheme that is secure in the ROM may be vulnerable to various attacks in real-world applications. Precisely, we show that our IBBS is secure in the STM (even in quantum word) if the generalized computational Diffie–Hellman problem is hard. We compare our IBBS with several other BS schemes and show that our scheme is suitable for online transactions due to its small signature size and computational efficiency since it requires only three pairing operations.