Introduced by Ishai, Kilian, Nissim, and Petrank in 2003, the IKNP protocol solves the critical efficiency bottleneck in secure computation by reducing the heavy public-key cryptography overhead. It bootstraps a few (e.g., 128) base OTs into millions of OT instances using only cheap symmetric-key primitives, dramatically lowering the computational cost of protocols like Private Set Intersection (PSI) and Garbled Circuits.
Glossary
IKNP Protocol

What is IKNP Protocol?
The IKNP protocol is the foundational Oblivious Transfer (OT) extension framework that enables the efficient generation of a massive number of oblivious transfers from a small, constant number of base OTs using only fast symmetric-key operations.
The protocol operates by having the receiver encode their choice bits into a matrix, which is then processed using the base OTs and a correlation-robust hash function to break the correlation between extended OTs. This construction achieves semi-honest security and forms the core engine behind modern high-speed PSI protocols such as KKRT, making large-scale private data matching computationally feasible.
Key Features of the IKNP Protocol
The IKNP protocol, introduced by Ishai, Kilian, Nissim, and Petrank, is the seminal work that established the OT extension paradigm. It enables the generation of a massive number of oblivious transfers using only a small number of base OTs and cheap symmetric-key operations, forming the computational backbone for most modern high-performance PSI protocols.
The OT Extension Paradigm
The core innovation of IKNP is reducing the cost of many OTs to the cost of a few. It works by:
- Bootstrapping: Performing a small number (e.g., 128) of base OTs using expensive public-key cryptography.
- Expansion: Using these base OTs and a fast symmetric primitive like a hash function to generate millions of correlated strings.
- Result: The amortized cost per extended OT drops to a few symmetric-key operations, making OT practical for large-scale secure computation.
Correlation-Robust Hashing
IKNP relies on a specific security assumption for its hash function. The protocol requires the hash to be correlation-robust, meaning outputs remain pseudorandom even when inputs are correlated.
- This is a stronger requirement than standard collision resistance.
- It is formally modeled in the random oracle model for security proofs.
- Practical instantiations often use AES-based constructions or SHA variants, assuming they behave like a random oracle.
Security Model: Semi-Honest
The original IKNP protocol is proven secure in the semi-honest model. This assumes:
- Both parties follow the protocol specification exactly.
- An adversary may try to learn extra information from the transcript.
- It does not protect against an active attacker who deviates from the protocol. Achieving malicious security requires additional techniques like consistency checks on top of the IKNP foundation.
1-out-of-2 OT Foundation
IKNP extends the most common variant: 1-out-of-2 oblivious transfer. In this setting:
- The sender inputs two strings (m0, m1).
- The receiver inputs a choice bit b.
- The receiver learns m_b, and the sender learns nothing about b.
- The protocol efficiently generates many instances of this primitive, which can then be used as building blocks for garbled circuits and PSI protocols like KKRT.
Matrix Encoding Technique
The protocol's efficiency comes from a clever matrix encoding. The receiver creates a matrix where:
- Columns correspond to the number of extended OTs.
- Rows correspond to the number of base OTs.
- The receiver's choice bits are encoded as the columns, and the sender's secrets are masked using the transposed matrix. This structure allows the sender to obliviously transmit two secrets per column using only symmetric operations after the base OTs are complete.
Impact on Modern PSI
IKNP is not a PSI protocol itself, but it is the critical performance enabler. Its influence is seen in:
- KKRT Protocol: Directly uses IKNP-style OT extension with Cuckoo hashing for one of the fastest semi-honest PSI protocols.
- Ferret OT: A state-of-the-art extension that improves on IKNP using VOLE and quasi-cyclic codes for even higher throughput.
- Circuit-based PSI: Provides the millions of OTs needed to evaluate garbled circuit-based intersection logic.
Frequently Asked Questions
Explore the foundational OT extension protocol by Ishai, Kilian, Nissim, and Petrank that revolutionized secure computation by enabling efficient large-scale oblivious transfers.
The IKNP protocol is the foundational OT extension protocol introduced by Ishai, Kilian, Nissim, and Petrank in their 2003 paper "Extending Oblivious Transfers Efficiently." It enables the generation of a large number of oblivious transfers (OTs) from a small number of base OTs using only fast symmetric-key operations. The protocol works by having the receiver choose a random bit-string matrix, which is then used to mask the sender's secrets. The sender uses a correlation-robust hash function to derive the final OT outputs. This reduces the computational cost from expensive public-key operations per OT to just a few hash function evaluations per OT after the initial base OTs, making it practical for protocols requiring millions of OTs.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
IKNP Protocol vs. Other OT Extension Protocols
A technical comparison of the foundational IKNP protocol against subsequent OT extension optimizations used in modern PSI constructions.
| Feature | IKNP Protocol | KKRT Protocol | Ferret OT |
|---|---|---|---|
Underlying Primitive | Symmetric-key operations + base OTs | IKNP-style OT extension + Cuckoo hashing | Vector OLE (VOLE) + quasi-cyclic codes |
Security Model | Semi-honest | Semi-honest | Malicious (with consistency checks) |
Communication Complexity | O(n) symmetric, O(κ) base | O(n) with improved constants | Sub-linear in amortized setting |
Correlation Robustness | Random Oracle Model | Random Oracle Model | Quasi-cyclic code assumption |
Base OT Count | κ (security parameter, ~128) | κ | Constant (independent of κ) |
Computational Overhead | 3 PRG calls per extended OT | 2 PRG calls per extended OT | 1 VOLE correlation per OT |
Post-Quantum Ready | |||
Typical Throughput | ~10^6 OTs/sec | ~10^7 OTs/sec | ~10^8 OTs/sec |
Related Terms
The IKNP protocol is a foundational OT extension technique. Understanding the following related primitives and their roles is essential for grasping how modern, efficient PSI protocols are constructed.
Cuckoo Hashing
A hashing scheme that resolves collisions by relocating existing keys using multiple hash functions. In PSI protocols built on IKNP, Cuckoo hashing is used to optimally pack one party's set into bins, drastically reducing the number of OTs required and minimizing communication overhead.
Garbled Circuit
A general-purpose secure two-party computation protocol. While IKNP provides efficient OTs, garbled circuits can use these OTs to securely evaluate any Boolean function, including the intersection logic in Circuit PSI. IKNP supplies the critical input wires for this evaluation.
Semi-Honest Security
The primary security model for the original IKNP protocol. It assumes all parties follow the protocol correctly but may try to learn additional information from the transcript. This model allows for significant performance optimizations compared to stronger malicious security models.

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us