Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Artificial Intelligence and Computing (AIC)

Leakage-Resilient k-out-of-n Oblivious Transfer

Shuguang Dai, Huang Zhang, Yaofeng Ma, Jihai Huang

Published Apr 1, 2026• 0 citations
Publisher
DOI
10.1109/aic65131.2026.11633580

Related papers

One-sided leakage-resilient privacy only two-message oblivious transfer

Partha Sarathi Roy, Avishek Adhikari

Journal of Information Security and Applications•Nov 1, 2014•3 citations

Efficient 1-Out-n Oblivious Transfer Schemes

Wen-Guey Tzeng

Lecture notes in computer science•Jan 1, 2002•86 citations

LR-OT: Leakage-resilient oblivious transfer

Francesco Berti, Carmit Hazay, Itamar Levi

Abstract Oblivious Transfer ( $$\textsf{OT}$$ OT ) is a fundamental cryptographic primitive that becomes a crucial component of a practical secure protocol. $$\textsf{OT}$$ OT is typically implemented in software, and one way to accelerate its running time is by using hardware implementations. However, such implementations are vulnerable to side-channel attacks (SCAs). On the other hand, protecting interactive protocols against SCA is highly challenging due to their longer secrets (which include inputs and randomness), more complex design, and the need to run multiple instances. Consequently, there are no truly practical leakage-resistant $$\textsf{OT}$$ OT protocols yet. In this paper, we introduce two tailored indistinguishability-based security definitions for leakage-resilient $$\textsf{OT}$$ OT , focusing on protecting the sender’s state. Second, we propose a practical semi-honest secure $$\textsf{OT}$$ OT protocol that achieves these security levels while minimizing the assumptions on the protocol’s building blocks and the use of a secret state.

Cryptography and Communications•Jul 21, 2025•0 citations

Two provably secure k-out-of-n oblivious transfer schemes

Jianhong Zhang, Yumin Wang

Applied Mathematics and Computation•Dec 30, 2004•11 citations

$$\textsf{LR}$$-$$\textsf{OT}$$: Leakage-Resilient Oblivious Transfer

Francesco Berti, Carmit Hazay, Itamar Levi

Lecture notes in computer science•Jan 1, 2024•0 citations

Practical t-out-n Oblivious Transfer and Its Applications

Qianhong Wu, Jianhong Zhang, Yumin Wang

Lecture notes in computer science•Jan 1, 2003•23 citations
Abstract Oblivious Transfer ( OT\textsf{OT}OT OT ) is a fundamental cryptographic primitive that becomes a crucial component of a practical secure protocol. OT\textsf{OT}OT OT is typically implemented in software, and one way to accelerate its running time is by using hardware implementations. However, such implementations are vulnerable to side-channel attacks (SCAs). On the other hand, protecting interactive protocols against SCA is highly challenging due to their longer secrets (which include inputs and randomness), more complex design, and the need to run multiple instances. Consequently, there are no truly practical leakage-resistant OT\textsf{OT}OT OT protocols yet. In this paper, we introduce two tailored indistinguishability-based security definitions for leakage-resilient OT\textsf{OT}OT OT , focusing on protecting the sender’s state. Second, we propose a practical semi-honest secure OT\textsf{OT}OT OT protocol that achieves these security levels while minimizing the assumptions on the protocol’s building blocks and the use of a secret state.
LR\textsf{LR}LR-OT\textsf{OT}OT: Leakage-Resilient Oblivious Transfer