Endemic Oblivious Transfer via Random Oracles, Revisited
Zhelei Zhou, Bingsheng Zhang, Hong-Sheng Zhou, Kui Ren
Abstract
The notion of Endemic Oblivious Transfer (EOT) was introduced by Masny and Rindal (CCS'19). EOT offers a weaker security guarantee than the conventional random OT; namely, the malicious parties can fix their outputs arbitrarily. The authors presented a 1-round UC-secure EOT protocol under a tailor-made and non-standard assumption, Choose-and-Open DDH, in the RO model.
In this work, we systematically study EOT in the UC/GUC framework. We present a new 1-round UC-secure EOT construction in the RO model under the DDH assumption. Under the GUC framework, we propose the first 1-round EOT construction under the CDH assumption in the Global Restricted Observable RO (GroRO) model proposed by Canetti et al. (CCS'14). We also provide an impossibility result, showing there exist no 1-round GUC-secure EOT protocols in the Global Restricted Programmable RO (GrpRO) model proposed by Camenisch et al. (Eurocrypt'18).
Subsequently, we provide the first round-optimal (2-round) EOT protocol with adaptive security under the DDH assumption in the GrpRO model. Finally, we investigate the relations between EOT and other cryptographic primitives.
As side products, we present the first 2-round GUC-secure commitment in the GroRO model as well as a separation between the GroRO and the GrpRO models, which may be of independent interest.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- Two-Round Oblivious Transfer from CDH or LPNNico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny et al.EUROCRYPT 2020 · 52 citations
- Endemic Oblivious TransferDaniel Masny, Peter RindalCCS 2019 · 50 citations
- Compact, Efficient and UC-Secure Isogeny-Based Oblivious TransferYi-Fu Lai, Steven D. Galbraith, Cyprien Delpech de Saint GuilhemEUROCRYPT 2021 · 43 citations
- Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public FunctionsIan McQuoid, Mike Rosulek, Lawrence RoyCCS 2020
- Two-Round Maliciously-Secure Oblivious Transfer with Optimal RatePedro Branco, Nico Döttling, Akshayaram SrinivasanEUROCRYPT 2024 · 3 citations
