A pairing-free identity-based cryptosystem
Issued Date
2021
Issued Date (B.E.)
2564
Available Date
Copyright Date
Resource Type
Series
Edition
Language
eng
File Type
application/pdf
No. of Pages/File Size
49 leaves
ISBN
ISSN
eISSN
DOI
Other identifier(s)
b212776
Identifier(s)
Access Rights
Access Status
Rights
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Rights Holder(s)
Physical Location
National Institute of Development Administration. Library and Information Center
Bibliographic Citation
Citation
Poonsuk Ponpurmpoon (2021). A pairing-free identity-based cryptosystem. Retrieved from: https://repository.nida.ac.th/handle/662723737/5691.
Title
A pairing-free identity-based cryptosystem
Alternative Title(s)
Author(s)
Advisor(s)
Editor(s)
item.page.dc.contrubutor.advisor
Advisor's email
Contributor(s)
Contributor(s)
Abstract
ID-based cryptosystems (IBCs) allow the use of publicly identifiable information in public encryption keys, which reduces the overhead of certificate management and eliminates the need for a certificate authority in the public-key infrastructure. Up to now, bilinear pairing technology is usually used in ID-based paradigms. However, it is expensive in computation time and is unsuitable for mobile networks. Over recent years, the evolution of mobile devices has seen them transformed from a voice communication device to a daily life information center that is restricted by poor battery capacity and limited computation power. Thus, interest in pairing-free ID-based algorithms among researchers is growing. Herein, a pairing-free IBC consisting of ID-based encryption, digital signatures, and key exchange schemes is presented. All of the schemes use the same public and private key definitions, which makes IBC implementation straightforward. Proof of the correctness and security analysis of the scheme are provided. Furthermore, the performance of the proposed system is compared with well-known pairing-based systems and other well-known pairing-free ones.
Table of contents
Description
Thesis (Ph.D. (Computer Science and Information Systems))--National Institute of Development Administration, 2021