HomePublications

Performance and Security Evaluations of Identity-and Pairing-based Digital Signature Algorithms on Windows, Android, and Linux Platforms: Revisiting the Algorithms of Cha and Cheon, Hess, Barreto, Libert, McCullagh and Quisquater, and Paterson and Schuldt

Research output: Contribution to journalArticle

Open Access permissions

Open

Documents

Links

DOI

Authors

  • Sheng Zhong
  • Wei Ren
  • Tianqing Zhu
  • Yi Ren
  • Kim-Kwang Raymond Choo

Organisational units

Abstract

Bilinear pairing, an essential tool to construct-efficient digital signatures, has applications in mobile devices and other applications. One particular research challenge is to design cross-platform security protocols (e.g. Windows, Linux, and other popular mobile operating systems) while achieving an optimal security-performance tradeoff. That is, how to choose the right digital signature algorithm, for example, on mobile devices while considering the limitations on both computation capacity and battery life. In this paper, we examine the security-performance tradeoff of four popular digital signature algorithms, namely: CC (proposed by Cha and Cheon in 2003), Hess (proposed by Hess in 2002), BLMQ (proposed by Barreto et al. in 2005), and PS (proposed by Paterson and Schuldt in 2006), on various platforms. We empirically evaluate their performance using experiments on Windows, Android, and Linux platforms, and find that BLMQ algorithm has the highest computational efficiency and communication efficiency. We also study their security properties under the random oracle model and assuming the intractability of the CDH problem, we reveal that the BLMQ digital signature scheme satisfies the property of existential unforgeable on adaptively chosen message and ID attack. The efficiency of PS algorithm is lower, but it is secure under the standard model.

Details

Original languageEnglish
Pages (from-to)37850-37857
JournalIEEE Access
Volume6
DOIs
StatePublished - 6 Jul 2018
Peer-reviewedYes

View graph of relations

ID: 139798452

Related by author
  1. r-Hint: A message-efficient random access response for mMTC in 5G networks

    Research output: Chapter in Book/Report/Conference proceedingConference contribution