Paper 2025/236

Diamond iO: Indistinguishability Obfuscation at Near Functional-Encryption Cost via Matrix Products

Sora Suegami, Machina iO, Ethereum Foundation
Enrico Bottazzi, Leku
Gayeong Park, Independent Researcher
Abstract

Indistinguishability obfuscation (iO) remains far from practical. A major source of inefficiency in recent iO schemes is the transformation from functional encryption (FE) to iO: evaluating the obfuscated circuit requires recursively invoking the FE encryption algorithm for each input bit. This FE-to-iO overhead creates a large efficiency gap between the underlying FE scheme and the resulting iO scheme. We propose Diamond iO, a lattice-based iO scheme based on a new FE-to-iO transformation that replaces this recursive FE encryption with simple matrix products. This makes the transformation cost asymptotically and concretely smaller than the cost of the underlying FE scheme, enabling iO at nearly the efficiency of the FE scheme itself. For obfuscated PRFs on $L$-bit inputs, using the same underlying FE scheme, the transformation-to-decryption cost ratio improves from $\Omega(L^5)$ in the prior transformation to $\Theta(1/L^2)$ in Diamond iO. Our concrete efficiency estimates show at least a $2^{118}$-fold improvement in the estimated transformation running time under the same comparison setting, with our transformation step taking less than $10^{-31}\,\%$ of the estimated total evaluation running time. Our transformation applies to FE schemes with a special ciphertext structure, formalized as path-factorized functional encryption (PFFE). PFFE yields indistinguishable pseudorandom obfuscation (iPRO), and hence iO for general circuits in the pseudorandom oracle model. Instantiating our transformation with our PFFE construction yields an iPRO scheme from LWE, private-coin evasive LWE, and a new assumption called all-product LWE. We explain why all-product LWE avoids the known rank attack of Chen et al. (TCC'19). Additionally, our noise-growth optimization for PFFE decryption enables concrete end-to-end efficiency estimates with realistic lattice parameters. Although PFFE decryption remains the dominant cost, Diamond iO removes the FE-to-iO transformation bottleneck, advancing the path toward practical iO.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Keywords
indistinguishability obfuscationfunctional encryptionevasive LWElatticeskey-homomorphic encodings
Contact author(s)
sora suegami @ ethereum org
enrico @ leku ink
piapark314 @ gmail com
History
2026-06-18: last of 6 revisions
2025-02-15: received
See all versions
Short URL
https://ia.cr/2025/236
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/236,
      author = {Sora Suegami and Enrico Bottazzi and Gayeong Park},
      title = {Diamond {iO}: Indistinguishability Obfuscation at Near Functional-Encryption Cost via Matrix Products},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/236},
      year = {2025},
      url = {https://eprint.iacr.org/2025/236}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.