|
Mathematical Methods of Cryptography
ID-based public key cryptographic systems
A. V. Cheremushkin Academy of Cryptography of the Russian Federation, Moscow, Russia
Abstract:
A surway contains an analisys of practical aspects of ID-based public key cryptography. IDB-systems simplify a certificate management process, but trusted requirements for the key generation center (KGC) must be very stronger than for certification authority. When key escrow property is not assumed, users' private keys should be protected from malicious KGC. Many networks need hierarchical KGC architecture. In the paper, we describe a basic mathematical constructions applied in ID-based cryptosystems. We survey fundamental ID-based cryptographic primitives: Key extraction, Key Escrow, Encryption, Digital Signature, Identification Scheme and Key Agreement, which are based on the mathematical concepts of Integer Factorization, Quadratic Residues, Discret Logarithms, and Bilinear Pairings. We review several schemes to illustrate different approaches and practical solutions.
Keywords:
ID-based cryptography, public key cryptography, elliptic curve, bilinear pairing.
Citation:
A. V. Cheremushkin, “ID-based public key cryptographic systems”, Prikl. Diskr. Mat., 2023, no. 61, 44–85
Linking options:
https://www.mathnet.ru/eng/pdm812 https://www.mathnet.ru/eng/pdm/y2023/i3/p44
|
Statistics & downloads: |
Abstract page: | 63 | Full-text PDF : | 71 | References: | 23 |
|