A provable secure pairing-free certificateless identification scheme

DOI10.1080/00207160.2014.957196zbMath1357.94064OpenAlexW1985788142MaRDI QIDQ5266147

Syh-Yuan Tan, Swee-Huay Heng, Rouzbeh Behnia, Raphael C.-W. Phan, Ji-Jian Chin

Publication date: 30 July 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.957196

zbMATH Keywords

discrete logarithmpairing-freeprovable securecertificateless identificationno key escrow

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• An efficient certificateless two-party authenticated key agreement protocol
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• An efficient certificateless proxy signature scheme without pairing

This page was built for publication: A provable secure pairing-free certificateless identification scheme