A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Identity-Based Encryption

Research Depth 99 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
539prerequisites beneath it
See this on the map →
Computational Hardness AssumptionsElliptic Curve Cryptography Basics→→Attribute-Based Encryption
ibe boneh-franklin bilinear-pairing key-escrow pki-alternative

Core Idea

Identity-based encryption (IBE) allows a sender to encrypt to a recipient using only their identity (email address, phone number) as the public key — no certificate lookup needed. A trusted Key Generation Center (KGC) holds a master secret key and derives private keys from identities. Boneh and Franklin (2001) gave the first efficient IBE construction using bilinear pairings on elliptic curves. IBE simplifies key management (no PKI needed) but introduces key escrow (the KGC can decrypt all messages). IBE also enables advanced features like fuzzy/attribute-based encryption and hierarchical delegation.

Explainer

Traditional public-key encryption requires the sender to know the recipient's public key, which means obtaining and verifying a certificate — the entire PKI infrastructure of certificate authorities, revocation lists, and trust chains. Identity-Based Encryption (IBE), conceived by Adi Shamir in 1984 and first efficiently realized by Boneh and Franklin in 2001, eliminates this requirement. In IBE, the recipient's public key IS their identity — their email address, phone number, employee ID, or any arbitrary string. Anyone can encrypt to "alice@example.com" using only this string and the system's public parameters, without any certificate.

The scheme requires a Key Generation Center (KGC) that holds a master secret key. During setup, the KGC publishes system-wide public parameters. When Alice wants to decrypt, she authenticates to the KGC and receives her private key, derived from her identity and the master secret. The mathematical magic that makes this work is bilinear pairings on elliptic curves: a function e: G1 x G2 → GT satisfying e(aP, bQ) = e(P, Q)ab. This bilinearity creates algebraic bridges between the identity-derived public key and the master-secret-derived private key that enable encryption and decryption to work, while the hardness of the Bilinear Diffie-Hellman (BDH) problem prevents anyone without the private key from decrypting.

The most notable feature and the most significant limitation of IBE are two sides of the same coin: key escrow. Since the KGC generates all private keys, it can decrypt any message in the system. This is unacceptable for many applications (users expect end-to-end privacy from everyone, including the system operator), but it is actually desirable in enterprise environments where the organization legitimately needs the ability to decrypt employee communications (legal compliance, departing employees, regulatory audits). For organizations that already have centralized authority over their users' cryptographic credentials, IBE offers dramatic simplification over PKI.

IBE's impact extends well beyond its direct use case. It demonstrated that bilinear pairings could solve long-standing open problems in cryptography, spawning an entire field of pairing-based cryptography that includes short signatures (Boneh-Lynn-Shacham), attribute-based encryption, functional encryption, and efficient non-interactive zero-knowledge proofs. Hierarchical IBE (HIBE) allows delegation of key generation authority, mirroring organizational structures. Fuzzy IBE (Sahai-Waters) allows decryption when the identity matches "approximately" — if the encryption identity and the key identity share enough attributes — which is the conceptual precursor to attribute-based encryption. The line of research from IBE through ABE to general functional encryption represents the progressive expansion of what "access control through cryptography" can achieve.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Boolean Algebra and Fundamental Laws → Logic Gates Fundamentals → Implementing Boolean Functions with Gates → Karnaugh Map Simplification → Combinational Circuit Design → Flip-Flops and Latches → Finite State Machines (FSMs) → Deterministic Finite Automata (DFA) → Nondeterministic Finite Automata (NFA) → Two-Way Finite Automata → NFA to DFA Conversion (Subset Construction) → DFA Properties and Minimization Algorithms → Regular Languages: Definition and Characterization → Context-Free Grammars (CFGs) → Pushdown Automata (PDA) → Equivalence of CFGs and Pushdown Automata → Closure Properties of Context-Free Languages → Limitations of Context-Free Languages → Pumping Lemma for Context-Free Languages → Turing Machines → Variants of Turing Machines and Equivalence → Nondeterministic Time Complexity and NP → The P vs. NP Problem → Complexity Class P: Polynomial Time → Hash Functions and Collision Resistance → The RSA Cryptosystem → Computational Hardness Assumptions → Identity-Based Encryption

Longest path: 100 steps · 539 total prerequisite topics

Prerequisites (2)

Leads To (1)