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

Lecture notes in computer science

Efficient Adaptive Oblivious Transfer Without q-type Assumptions in UC Framework

Vandana Guleria, Ratna Dutta

Published Jan 1, 2015• 1 citation
Publisher
DOI
10.1007/978-3-319-21966-0_8

Related papers

Efficient Adaptive Oblivious Transfer in UC Framework

Vandana Guleria, Ratna Dutta

Lecture notes in computer science•Jan 1, 2014•5 citations

Practical Adaptive Oblivious Transfer from Simple Assumptions

Matthew Green, Susan Hohenberger

Lecture notes in computer science•Jan 1, 2011•42 citations

Adaptive Oblivious Transfer with Access Control from Lattice Assumptions

Benoît Libert, San Ling, Fabrice Mouhartem +2 more

Lecture notes in computer science•Jan 1, 2017•22 citations

Adaptive oblivious transfer with access control from lattice assumptions

Benoît Libert, San Ling, Fabrice Mouhartem +2 more

Theoretical Computer Science•Sep 8, 2021•3 citations

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

Ran Canetti, Pratik Sarkar, Xiao Shaun Wang

Lecture notes in computer science•Jan 1, 2020•18 citations

Simple Two-Message OT in the Explicit Isogeny Model

Emmanuela Orsini, Riccardo Zanotto

In this work we study algebraic and generic models for group actions, and extend them to the universal composability (UC) framework of Canetti (FOCS 2001). We revisit the constructions of Duman et al. (PKC 2023) integrating the type-safe model by Zhandry (Crypto 2022), adapted to the group action setting, and formally define an algebraic action model (AAM). This model restricts the power of the adversary in a similar fashion to the algebraic group model (AGM). By imposing algebraic behaviour to the adversary and environment of the UC framework, we construct the UC-AAM. Finally, we instantiate UC-AAM with isogeny-based assumptions, in particular the CSIDH action with twists, obtaining the explicit isogeny model, UC-EI; we observe that, under certain assumptions, this model is "closer" to standard UC than the UC-AGM, even though there still exists an important separation. We demonstrate the utility of our definitions by proving UC-EI security for the passive-secure oblivious transfer protocol described by Lai et al. (Eurocrypt 2021), hence providing the first concretely efficient two-message isogeny-based OT protocol in the random oracle model against malicious adversaries.

IACR Communications in Cryptology•Apr 9, 2024•7 citations
In this work we study algebraic and generic models for group actions, and extend them to the universal composability (UC) framework of Canetti (FOCS 2001). We revisit the constructions of Duman et al. (PKC 2023) integrating the type-safe model by Zhandry (Crypto 2022), adapted to the group action setting, and formally define an algebraic action model (AAM). This model restricts the power of the adversary in a similar fashion to the algebraic group model (AGM). By imposing algebraic behaviour to the adversary and environment of the UC framework, we construct the UC-AAM. Finally, we instantiate UC-AAM with isogeny-based assumptions, in particular the CSIDH action with twists, obtaining the explicit isogeny model, UC-EI; we observe that, under certain assumptions, this model is "closer" to standard UC than the UC-AGM, even though there still exists an important separation. We demonstrate the utility of our definitions by proving UC-EI security for the passive-secure oblivious transfer protocol described by Lai et al. (Eurocrypt 2021), hence providing the first concretely efficient two-message isogeny-based OT protocol in the random oracle model against malicious adversaries.