Certificateless Public Key Cryptography
Sattam S. Al-Riyami,Kenneth G. Paterson +1 more
- pp 452-473
TLDR
In this article, the concept of certificateless public key cryptography (CL-PKC) was introduced and made concrete, which does not require certificates to guarantee the authenticity of public keys.Abstract:
This paper introduces and makes concrete the concept of certificateless public key cryptography (CL-PKC), a model for the use of public key cryptography which avoids the inherent escrow of identity-based cryptography and yet which does not require certificates to guarantee the authenticity of public keys The lack of certificates and the presence of an adversary who has access to a master key necessitates the careful development of a new security model We focus on certificateless public key encryption (CL-PKE), showing that a concrete pairing-based CL-PKE scheme is secure provided that an underlying problem closely related to the Bilinear Diffie-Hellman Problem is hardread more
Citations
More filters
Journal ArticleDOI
Security and privacy in electronic health records: A systematic literature review
José Luis Fernández-Alemán,Inmaculada Carrión Señor,Pedro Ángel Oliver Lozoya,Ambrosio Toval +3 more
TL;DR: A systematic literature review concerning the security and privacy of electronic health record (EHR) systems found 23 articles that used symmetric key and/or asymmetric key schemes and 13 articles that employed the pseudo anonymity technique in EHR systems.
Journal ArticleDOI
A Survey on Recent Advances in Vehicular Network Security, Trust, and Privacy
Zhaojun Lu,Gang Qu,Zhenglin Liu +2 more
TL;DR: This survey article starts with the necessary background of VANETs, followed by a brief treatment of main security services, and focuses on an in-depth review of anonymous authentication schemes implemented by five pseudonymity mechanisms.
Book ChapterDOI
On the security of certificateless signature schemes from asiacrypt 2003
TL;DR: This paper provides an attack that can successfully forge a certificateless signature in their model and fixes the problem by proposing a new scheme.
Journal ArticleDOI
Certificateless Remote Anonymous Authentication Schemes for WirelessBody Area Networks
TL;DR: A pair of efficient and light-weight authentication protocols to enable remote WBAN users to anonymously enjoy healthcare service and outperform the existing schemes in terms of better trade-off between desirable security properties and computational overhead, nicely meeting the needs of WBANs.
Book ChapterDOI
Certificateless signature revisited
TL;DR: This paper revisits the security models of certificateless signatures and proposes two new constructions which are provably secure in the random oracle model and proves secure against Normal Type I and Super Type II Adversary.
References
More filters
Book ChapterDOI
Identity-based cryptosystems and signature schemes
TL;DR: In this article, the authors introduce a novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other's signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party.
Journal ArticleDOI
Identity-Based Encryption from the Weil Pairing
Dan Boneh,Matthew K. Franklin +1 more
TL;DR: This work proposes a fully functional identity-based encryption (IBE) scheme based on bilinear maps between groups and gives precise definitions for secure IBE schemes and gives several applications for such systems.
Book ChapterDOI
Hierarchical ID-Based Cryptography
Craig Gentry,Alice Silverberg +1 more
TL;DR: In this article, the authors presented hierarchical identity-based encryption schemes and signature schemes that have total collusion resistance on an arbitrary number of levels and that have chosen ciphertext security in the random oracle model assuming the difficulty of the Bilinear Diffie-Hellman problem.
Book ChapterDOI
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Charles Rackoff,Daniel R. Simon +1 more
TL;DR: A formalization of chosen ciphertext attack is given in the model which is stronger than the "lunchtime attack" considered by Naor and Yung, and it is proved a non-interactive public-key cryptosystem based on non-Interactive zero-knowledge proof of knowledge to be secure against it.
Proceedings ArticleDOI
Non-malleable cryptography
TL;DR: Non-malleable schemes for each of the contexts of string commitment and zero-knowledge proofs of possession of knowledge, where a user need not know anything about the number or identity of other system users are presented.