Deriving Public Keys Directly from Unique Identifiers

123 concepts91 papers1 proposal

In traditional public-key cryptography, if you want to send an encrypted message to Alice, you face a fundamental trust problem: how do you know that the public key you are using actually belongs to Alice, and not to an impersonator?

The conventional solution is Public Key Infrastructure (PKI). Alice generates a random mathematical key pair and registers it with a trusted third party called a Certificate Authority (CA). The CA issues a digital certificate—a signed statement binding Alice's real-world identity to her public key.

While secure, this approach imposes a heavy "certificate tax." Every time a user or device wants to authenticate a message, they must transmit, store, and validate complex certificate chains and check Certificate Revocation Lists (CRLs). As noted by Refik Molva in Identity Based Message Authentication for Dynamic Networks, this overhead can cause network bootstrapping complexity to scale quadratically, making traditional PKI highly impractical for dynamic, ad-hoc, or resource-constrained environments.

Identity-Based Cryptography (IBC) completely flips this paradigm. Instead of using an external certificate to bind an identity to a random key, the identity string itself becomes the public key.


How Identity Becomes a Key

In an identity-based system, any publicly known, unique identifier can serve as a public key. This could be a human-readable string like an email address, a network-native identifier like an IP address or Session Initiation Protocol (SIP) address, or a hardware identifier like an Autonomous System (AS) number.

To understand why this works without certificates, consider the lifecycle of a secure interaction:

  1. Independent Key Derivation: Because the public key is derived directly from a known identity string via a public mathematical function, a sender can encrypt a message or verify a signature without looking up a certificate. For example, Xian-Zhu Li demonstrates in An Improved TLS handshake protocol that if a server's IP or email address is already known to a client, the client can independently compute the server's public key. This eliminates the need for the server to transmit proof of its key during a TLS handshake, accelerating the process and cutting data overhead.
  2. The Private Key Generator (PKG): Since public keys are generated deterministically from identities, users do not generate their own private keys. Instead, a trusted central authority called the Private Key Generator (PKG) manages a master secret key.
  3. Decoupled Key Issuance: When Alice wants to decrypt a message sent to her email address, she authenticates herself to the PKG. The PKG uses its master secret and Alice's identity string to mathematically derive and distribute her private key.

As Colin Boyd et al. observe in Security of Two-Party Identity-Based Key Agreement, shifting from random keys to identity strings radically simplifies key management across distributed systems, though it requires robust protocols to handle secure session key establishment and protect the PKG's master secret.


Overcoming the Computational Tax

Early identity-based schemes relied heavily on bilinear pairings over elliptic curves to link identity strings to private keys. However, these pairings introduce significant computational overhead. To make identity-based public key derivation practical for real-world applications, researchers have developed several architectural optimizations.

Bypassing Admissible Encoding

Traditional identity-based frameworks require mapping arbitrary text strings directly to specific mathematical points on an elliptic curve—a process known as admissible encoding. This step requires expensive scalar multiplications. To alleviate this, Tsz Hon Yuen et al. demonstrate in Signcryption in Hierarchical Identity Based Cryptosystem that constructions can be designed to bypass admissible encoding entirely. Eliminating this step significantly reduces the processing burden on mobile and low-power devices while preserving the core benefits of identity-based addressing.

Self-Certified Public Keys

Another optimization involves self-certified public keys, which blend identity-based derivation with a signature from a trusted authority. Instead of maintaining massive certificate databases, the public key itself contains the mathematical proof of its own validity.

Shudong Li et al. leverage this in An efficient dynamic ID-based remote user authentication scheme using self-certified public keys for multi-server environments to eliminate server-side verification tables and reduce communication overhead. Similarly, Giuseppe Ateniese et al. apply self-certified keys in Certified Bitcoins, integrating identity verification directly into the cryptographic key derivation process to prevent ledger bloat while maintaining transaction efficiency.

Offloading and Precomputation

For highly constrained hardware, the mathematical load can be split or offloaded. Mohammed Ramadan introduces a server-aided verification scheme in Identity-Based Signature With Server-Aided Verification Scheme for 5G Mobile Systems that offloads heavy signature verification math to a network server, reducing the computational burden on mobile devices by over 50%.

Alternatively, Ya Gao et al. propose an online/offline splitting technique in An Improved Online/Offline Identity-Based Signature Scheme for WSNs, allowing sensor nodes to perform heavy cryptographic precomputations offline so that the real-time online signing phase requires minimal battery power.


Applications in Distributed Networks

By removing the logistical burden of certificate distribution and revocation, identity-based key derivation has become a foundational tool for securing modern distributed infrastructure.

Cloud Storage and Auditing

In cloud environments, users need to audit the integrity of their outsourced data without downloading it entirely. Hongwei Li et al. demonstrate in Identity-Based Cryptography for Cloud Security that replacing certificate-based verification with identity-based cryptography slashes communication overhead by roughly 70% and client-side computation by over 80%.

This paradigm is further extended in public auditing frameworks designed by Haiyang Yu et al. (Efficient and Secure Identity-Based Public Auditing for Dynamic Outsourced Data with Proxy) and Fan Yu et al. (Identity-Based Auditing for Shared Cloud Data With Efficient and Secure Sensitive Information Hiding), which map user identities directly to cryptographic parameters to streamline secure data sharing and sensitive information hiding.

IoT and Vehicular Networks

In bandwidth-limited environments like the Internet of Things (IoT) and Vehicular Ad-hoc Networks (VANETs), transmitting bulky certificates for every message can cripple network performance. HUI LI addresses this in Lower Rounds Lattice-based Anonymous AKA under the seCK model for the IoT by utilizing device identifiers as public keys to achieve zero pre-transmission overhead in a post-quantum secure key agreement protocol.

For connected autonomous vehicles, where safety messages must be verified with sub-millisecond latency, Al Tariq Sheik et al. show in Comparative evaluation of pseudonym-based anonymisation techniques for connected autonomous vehicles (CAVs) that using a vehicle's registration number or pseudonym as a public key drastically reduces data transfer compared to traditional PKI, ensuring that safety-critical communications are not delayed by certificate validation bottlenecks.

Decentralized Systems and Layer 2 Blockchains

Managing traditional cryptographic certificates for millions of decentralized nodes or IoT devices is notoriously difficult. To bridge user-friendly identity management with blockchain scalability, Zijian Bao et al. introduce identity-based adaptor signatures in An Identity-Based Adaptor Signature Scheme and its Applications in the Blockchain System. This approach allows human-readable identifiers to execute off-chain conditional logic (such as atomic swaps) without requiring pre-transaction public key exchanges, simplifying the deployment of Layer 2 solutions across large-scale networks.

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 86 papers
  2. Version 1 · 2026-10-04 · 81 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_identity_based_cryptography_623d7675,
  title = {identity-based cryptography},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/identity-based-cryptography/rdr_623d7675e44e44bcbe29805fe2f37c9e},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 2, frozen text):

@misc{lacuna_identity_based_cryptography_623d7675_v2,
  title = {identity-based cryptography},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/identity-based-cryptography/rdr_623d7675e44e44bcbe29805fe2f37c9e/v/2},
  note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}
About

These directions overlap with this one through shared papers.

See something wrong? Report a mistake