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 on data engineering and communications technologies

Oblivious Transfer Protocols Based on Group Factoring Problem

Jing Li, Xiong Li, Licheng Wang, Debiao He, Xinxin Niu

Published Oct 21, 2016• 1 citation
Publisher
DOI
10.1007/978-3-319-49106-6_90

Related papers

Practical Oblivious Transfer Protocols

Christian Tobias

Springer eBooks•Aug 12, 2007•9 citations

Lattice-based oblivious transfer protocol

Zhenhua Liu

Utilizing a trapdoor one-way function based on learning with errors(LWE),a three moves oblivious transfer(OT) protocol was proposed.Both the privacy of the receiver's choice and the secrecy of the unchosen secret were based on the hardness of the LWE problem.Since merely modular multiplication and modular addition operations were used,the proposed OT protocol was efficient.Moreover,the plaintext-to-ciphertext expansion factor was amortized,which sig-nificantly shortened the message length,and made the protocol achieved optimal efficiency.

Journal of Communications•Jan 1, 2011•1 citation

Protocols for Authenticated Oblivious Transfer

Mehrad Jaberi, Hamid Mala

Modares Journal of Electrical Engineering•Oct 1, 2016•0 citations

Obliq: a Novel Protocol for Oblivious Transfer

M. K. Srivastava, Sunil Kumar Singh, Pradeep Kumar Singh

Oblivious transfer is a type of message transfer in which a sender transmits one out of many potential pieces of information to the receiver, but she has no knowledge about the actual piece of information being received by the receiver. Oblivious transfer is a deceptively simple scheme that has many possible applications such as secure multiparty computation, private set intersection, federated learning, zero-knowledge proofs, accessing sensitive data etc. Security of most classical oblivious transfer protocols is based upon the unproven assumptions about the computational complexity of certain number theoretic problems such as integer factorization. So, existing classical protocols for oblivious transfer are only computationally secure and not unconditionally secure. Although many quantum oblivious protocols have been proposed lately, they are not simple and easy to implement. In the present work we propose a quantum oblivious transfer protocol that is efficient, simple and easily implementable with the existing quantum technology.

Proceedings of NAS RA Physics•Nov 5, 2025•0 citations

Obliq: A Novel Protocol for Oblivious Transfer

M. K. Srivastava, P. K. Singh, S. K. Singh

Abstract Oblivious transfer is a type of message transfer in which a sender transmits one out of many potential pieces of information to the receiver, but she has no knowledge about the actual piece of information being received by the receiver. Oblivious transfer is a deceptively simple scheme that has many possible applications such as secure multiparty computation, private set intersection, federated learning, zero-knowledge proofs, accessing sensitive data etc. Security of most classical oblivious transfer protocols is based upon the unproven assumptions about the computational complexity of certain number theoretic problems such as integer factorization. So, existing classical protocols for oblivious transfer are only computationally secure and not unconditionally secure. Although many quantum oblivious protocols have been proposed lately, they are not simple and easy to implement. In the present work we propose a quantum oblivious transfer protocol that is efficient, simple and easily implementable with the existing quantum technology.

Journal of Contemporary Physics (Armenian Academy of Sciences)•Sep 1, 2025•0 citations

Alternative Protocols for Generalized Oblivious Transfer

Bhavani Shankar, Kannan Srinathan, Chandrasekharan Pandu Rangan

Springer eBooks•Dec 19, 2007•50 citations
Utilizing a trapdoor one-way function based on learning with errors(LWE),a three moves oblivious transfer(OT) protocol was proposed.Both the privacy of the receiver's choice and the secrecy of the unchosen secret were based on the hardness of the LWE problem.Since merely modular multiplication and modular addition operations were used,the proposed OT protocol was efficient.Moreover,the plaintext-to-ciphertext expansion factor was amortized,which sig-nificantly shortened the message length,and made the protocol achieved optimal efficiency.
Oblivious transfer is a type of message transfer in which a sender transmits one out of many potential pieces of information to the receiver, but she has no knowledge about the actual piece of information being received by the receiver. Oblivious transfer is a deceptively simple scheme that has many possible applications such as secure multiparty computation, private set intersection, federated learning, zero-knowledge proofs, accessing sensitive data etc. Security of most classical oblivious transfer protocols is based upon the unproven assumptions about the computational complexity of certain number theoretic problems such as integer factorization. So, existing classical protocols for oblivious transfer are only computationally secure and not unconditionally secure. Although many quantum oblivious protocols have been proposed lately, they are not simple and easy to implement. In the present work we propose a quantum oblivious transfer protocol that is efficient, simple and easily implementable with the existing quantum technology.
Abstract Oblivious transfer is a type of message transfer in which a sender transmits one out of many potential pieces of information to the receiver, but she has no knowledge about the actual piece of information being received by the receiver. Oblivious transfer is a deceptively simple scheme that has many possible applications such as secure multiparty computation, private set intersection, federated learning, zero-knowledge proofs, accessing sensitive data etc. Security of most classical oblivious transfer protocols is based upon the unproven assumptions about the computational complexity of certain number theoretic problems such as integer factorization. So, existing classical protocols for oblivious transfer are only computationally secure and not unconditionally secure. Although many quantum oblivious protocols have been proposed lately, they are not simple and easy to implement. In the present work we propose a quantum oblivious transfer protocol that is efficient, simple and easily implementable with the existing quantum technology.