I-(OT)^2: A Client-optimal Oblivious Transfer Protocol for IoT Devices

• URL: http://arxiv.org/abs/2606.02344v1
• Date: Mon, 01 Jun 2026 14:54:08 GMT
• Title: I-(OT)^2: A Client-optimal Oblivious Transfer Protocol for IoT Devices
• Abstract summary: Oblivious Transfer (OT) is a fundamental cryptographic primitive enabling privacy-preserving computation.<n>We introduce $I$-$(OT)2$, a novel base 1-out-of-2 OT protocol grounded in the quadratic residuosity problem.<n>We show that for 128-bit security using a 3072-bit RSA, the receiver incurs an average online cost per OT as low as 2.80 s on desktop platforms and 39.90 s on IoT devices.
• Score: 2.1793134762413433
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Oblivious Transfer (OT) is a fundamental cryptographic primitive enabling privacy-preserving computation and constitutes a core building block for secure multi-party computation while supporting a wide range of security-sensitive applications: private information retrieval, zero-knowledge proofs, and password-authenticated key exchange, to cite a few. While recent advances in OT extension have significantly reduced amortised costs, their reliance on batches of random base OTs and substantial pre-computation phases limits their practicality in scenarios where the number of transfers is modest or where communication latency and client-side computation are critical constraints. In such settings, efficient base OT protocols remain both relevant and necessary. In this work, we introduce $I$-$(OT)^2$, a novel base 1-out-of-2 OT protocol grounded in the quadratic residuosity problem, specifically designed to minimise receiver-side computation and interaction. Our construction is particularly appealing on client--server architectures in which the receiver operates on low-power hardware, such as Internet of Things (IoT) devices. Through a lightweight offline pre-computation phase, $I$-$(OT)^2$ shifts the on-transfer computational burden almost entirely to the Sender, while reducing online communication to only six messages and four digests exchanged. We provide a detailed description of the protocol, accompanied by a formal proof of its security. Moreover, to demonstrate the viability of $I$-$(OT)^2$, we also present an open-source proof-of-concept implementation (in C language) evaluated on real IoT hardware. Results are staggering: for 128-bit security using a 3072-bit RSA modulus, the receiver incurs an average online cost per OT as low as 2.80 μs on desktop platforms and 39.90 μs on IoT devices, more than 10$\times$ faster than the well known SimplestOT.

Related papers

• Post-Quantum Cryptography from Quantum Stabilizer Decoding [40.84312119358882]
  Post-quantum cryptography currently rests on a small number of hardness assumptions.<n>We argue that decoding random quantum stabilizer codes is an excellent candidate.<n>We prove that the average-case hardness of quantum stabilizer decoding implies the core primitives of classical Cryptomania.
  arXiv  Detail & Related papers  (2026-03-19T16:35:31Z)
• LUT-Compiled Kolmogorov-Arnold Networks for Lightweight DoS Detection on IoT Edge Devices [20.271194684947282]
  Kolmogorov-Arnold Networks (KANs) offer a compact alternative to Multi-Layer Perceptrons (MLPs)<n>B-spline evaluation introduces significant computational overhead unsuitable for latency-critical IoT applications.<n>We propose a lookup table (LUT) compilation pipeline that replaces expensive spline computations with precomputed quantized tables.
  arXiv  Detail & Related papers  (2026-01-12T22:32:18Z)
• One-Shot Secure Aggregation: A Hybrid Cryptographic Protocol for Private Federated Learning in IoT [0.0]
  Hyb-Agg is a lightweight and communication-efficient secure aggregation protocol.<n>It integrates Multi-Key CKKS (MK-CKKS) homomorphic encryption with Elliptic Curve Diffie-Hellman (ECDH)-based additive masking.<n>We implement and evaluate Hyb-Agg on both high-performance and resource-constrained devices, including a Raspberry Pi 4.
  arXiv  Detail & Related papers  (2025-11-28T15:01:26Z)
• CryptPEFT: Efficient and Private Neural Network Inference via Parameter-Efficient Fine-Tuning [40.49435347359895]
  CryptPEFT is a one-way communication (OWC) architecture that confines encrypted solely to the adapter.<n>We evaluate CryptPEFT using Vision Transformer backbones across widely used image classification datasets.<n>Our results show that CryptPEFT significantly outperforms existing baselines, delivering speedups ranging from $20.62times$ to $291.48times$ in simulated wide-area network (WAN) and local-area network (LAN) settings.
  arXiv  Detail & Related papers  (2025-08-17T07:19:27Z)
• Trusted Compute Units: A Framework for Chained Verifiable Computations [41.94295877935867]
  This paper introduces the Trusted Compute Unit (TCU), a unifying framework that enables composable and interoperable computations across heterogeneous technologies.<n>By enabling secure off-chain interactions without incurring on-chain confirmation delays or gas fees, TCUs significantly improve system performance and scalability.
  arXiv  Detail & Related papers  (2025-04-22T09:01:55Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• Supersonic OT: Fast Unconditionally Secure Oblivious Transfer [1.90298817989995]
  Supersonic OT is a highly efficient and unconditionally secure cryptographic protocol. A single instance of Supersonic OT completes in 0.35 milliseconds, making it up to 2000 times faster than the state-of-the-art base OT.
  arXiv  Detail & Related papers  (2024-06-21T11:50:57Z)
• Relating non-local quantum computation to information theoretic cryptography [0.0]
  Non-local quantum computation (NLQC) is a cheating strategy for position-verification schemes, and has appeared in the context of the AdS/CFT correspondence. We show one special case of NLQC, known as $f$-routing, is equivalent to the quantum analogue of the conditional disclosure of secrets primitives. By relating position-verification to these cryptographic primitives, a number of results in the cryptography literature give new implications for NLQC.
  arXiv  Detail & Related papers  (2023-06-28T18:00:05Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• ScionFL: Efficient and Robust Secure Quantized Aggregation [36.668162197302365]
  We introduce ScionFL, the first secure aggregation framework for federated learning. It operates efficiently on quantized inputs and simultaneously provides robustness against malicious clients. We show that with no overhead for clients and moderate overhead for the server, we obtain comparable accuracy for standard FL benchmarks.
  arXiv  Detail & Related papers  (2022-10-13T21:46:55Z)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.