A provable secure pairing-free certificateless identification scheme

DOI10.1080/00207160.2014.957196MaRDI QIDQ5266147zbMATH OpenOpenAlexFDO

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

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

certificateless identificationdiscrete logarithmno key escrowpairing-freeprovable secure

Mathematics Subject Classification ID

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

Recommendations

• A pairing-free and provably secure certificateless signature scheme
• A novel pairing-free certificateless authenticated key agreement protocol with provable security
• Provably secure certificate-based signature scheme without pairings
• A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges
• On Constructing Pairing-Free Identity-Based Encryptions
• scientific article; zbMATH DE number 708798
• Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 2080700 (Why is no real title available?)
• On Constructing Pairing-Free Identity-Based Encryptions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266147)