Paper 2025/1985

OUF: Oblivious Universal Function with domain specific optimizations

Victor Delfour, University of Quebec at Montreal
Marc-Olivier Killijian, UQAM
Abstract

The growing need for secure computation has spurred interest in cryptographic techniques that operate on encrypted data without revealing its content. Fully Homomorphic Encryption (FHE), especially LWE-based schemes, enables such processing while preserving confidentiality. Decentralized computing offers scalable resources without requiring in-house servers, but it relies heavily on the confidentiality guarantees of underlying schemes. While many existing protocols successfully protect input privacy, function confidentiality remains a largely overlooked but crucial aspect of secure delegated computation. In this work, we present a novel Oblivious Universal Function (OUF) scheme that enables a client to outsource computation of an arbitrary function to an untrusted server while hiding both the input data and the function being applied. Our construction leverages LWE-based FHE and a virtual-tape evaluation model to support composable, non-interactive, and reusable function execution. Crucially, the server remains oblivious not only to the encrypted inputs but also to the structure, type, and identity of the function it is executing. OUF thus bridges the gap between theoretical privacy guarantees and practical secure computation in decentralized environments.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Trustcom 2025
Keywords
Homomorphic Encryptionobliviousnessprivate computationdecentralized computation
Contact author(s)
delfour victor @ courrier uqam ca
killijian marc-olivier 2 @ uqam ca
History
2025-10-29: approved
2025-10-23: received
See all versions
Short URL
https://ia.cr/2025/1985
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/1985,
      author = {Victor Delfour and Marc-Olivier Killijian},
      title = {{OUF}: Oblivious Universal Function with domain specific optimizations},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1985},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1985}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.