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

Computer Engineering and Applications Journal

Oblivious transfer protocol with access control

YU Zhao-ping

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

Based on ECC,a new oblivious transfer protocol with access control has been proposed in this paper.The proposed protocol has the property of oblivious transfer.Futhermore,the only receiver who has issued by the trust centre authority can open the message which they chose and the sender can not decide whether the receiver has been authenticated or not by the trust centre.The identity of the receiver can not be confirmed by the sender.Under the ECDLP assumption,the proposed scheme has provable security.This protocol has less data,faster and more applied value than others which are based on FFDLP.

Related papers

RSA-based enhanced oblivious transfer protocol

Xinguo Li

Based on the RSA signature and (string) oblivious transfer, an enhanced oblivious transfer protocol is proposed which solves the access control problem for an oblivious transfer protocol. The protocol proposed has the property that only the receiver who has the signture issued by the central authority can open the message which he choose and that the sender can not decide whether the receiver has the signature or not. That is to say, the identity of the receiver can not be confirmed after the protocol. Under the decisional Diffie-Hellman assumption the proposed scheme has provable security.

Journal of Xidian University•Jan 1, 2005•0 citations

Efficient k-out-of-n oblivious transfer protocol.

Qinglong Wang

A new k-out-of-n oblivious transfer protocol is presented in this paper. The communication cost of our scheme are n+1 messages of sender to receiver and k messages from the receiver to sender. To the best knowledge of the authors, the communication complexity of our scheme is the least. Also, our scheme has a lower computation cost with (k+1)n modular exponentiations for sender and 3k modular exponentiations for the receiver. The security of our scheme is only based on the Decision Diffie-Hellman assumption. Further, we proved the sender’s computational security and the receiver’s unconditional security under standard model.

•Jan 1, 2015•1 citation

Oblivious Transfer Protocols Based on Commutative Encryption

Jen-Chieh Hsu, Raylin Tso, Yu‐Chi Chen +1 more

Oblivious transfer (OT) protocol is a fundamental building block of cryptography and can be applied widely in many fields. A secure oblivious transfer protocol is supposed to ensure the privacy of both senders and receivers. The privacy of receivers means that the information being selected by receivers would never be revealed to senders. On the other hand, the privacy of senders means that receivers have no further information except for the one that has been selected. In this case, senders are able to deceive receivers by sending same messages. Likewise, in existing 1-out-of-n OT protocols, malicious senders can make all the n messages the same, so that receivers will always get the specific one assigned by senders. This indicates that privacy of receivers wouldnt work under the 1-out-of-n OT protocol. To prevent this kind of attack, this paper provides a general framework on how to design a secure OT protocol based on commutative and ciphertext equality test and take RSA as an example to explain how the protocol is processed.

IFIP International Conference on New Technologies, Mobility and Security (NTMS)•Feb 1, 2018•4 citations

An Efficient Oblivious Transfer Protocol with Access Control

Yaqing Liao, Jing Li Zhou, Yang Yang +1 more

Due to the rapid development of internet in our daily life, protecting privacy has become a focus of attention. To create privacy-preserving database and prevent illegal user access the database, oblivious transfer with access control (OTAC) was proposed, which is a cryptographic primitive that extends from oblivious transfer (OT). It allows a user to anonymously query a database where each message is protected by an access control policy and only if the user' s attribute satisfy that access control policy can obtain it. In this paper, we propose a new protocol for OTAC by using elliptic curve cryptography, which is more efficient compared to the existing similar protocols. In our scheme, we also preserves user's anonymity and ensures that the user's attribute is not disclosed to the sender. Additionally, our construction guarantees the user to verify the correctness of messages recovered at the end of each transfer phase.

Asia Joint Conference on Information Security (AsiaJCIS)•Aug 1, 2018•0 citations

Verifiable oblivious transfer protocol

Chunming Tang

Oblivious transfer protocol,which is an important and useful cryptographic protocol,has been widely applied in cryptographic field,especially in construction of secure multi-party computation protocol.However,all of present oblivious transfer protocols have two drawbacks for requirement of their secrets: ① the receiver does not know whether message received is one of the messages held by the sender;② the sender does not know whether message received by the receiver is one of the messages designated by himself.In order to conquer these drawbacks,we firstly introduce the notion of verifiable oblivious transfer protocol,and firstly construct it by using proof protocol of knowledge,i.e.,∑-protocol,as main tool.

Journal of Guangzhou University•Jan 1, 2010•0 citations

Hidden authentication conditional oblivious transfer

Xinguo Li

Hidden authentication conditional oblivious transfer based on oblivious attribute credentials(OACerts) and hidden credentials is proposed and a scheme based on bilinear pairing for implementing the idea is constructed which solves the problem that OACerts may exposure some sensitive information of the receiver.The scheme proposed has the property that only the receiver who has the required attribute credentials can open the message corresponding to its attribute value and that the receiver need not provide to the sender any credentials.The sender can not decide whether or not the receiver can open the messages and which message he can open.

Journal of Xidian University•Jan 1, 2006•0 citations
Based on ECC,a new oblivious transfer protocol with access control has been proposed in this paper.The proposed protocol has the property of oblivious transfer.Futhermore,the only receiver who has issued by the trust centre authority can open the message which they chose and the sender can not decide whether the receiver has been authenticated or not by the trust centre.The identity of the receiver can not be confirmed by the sender.Under the ECDLP assumption,the proposed scheme has provable security.This protocol has less data,faster and more applied value than others which are based on FFDLP.
Based on the RSA signature and (string) oblivious transfer, an enhanced oblivious transfer protocol is proposed which solves the access control problem for an oblivious transfer protocol. The protocol proposed has the property that only the receiver who has the signture issued by the central authority can open the message which he choose and that the sender can not decide whether the receiver has the signature or not. That is to say, the identity of the receiver can not be confirmed after the protocol. Under the decisional Diffie-Hellman assumption the proposed scheme has provable security.
A new k-out-of-n oblivious transfer protocol is presented in this paper. The communication cost of our scheme are n+1 messages of sender to receiver and k messages from the receiver to sender. To the best knowledge of the authors, the communication complexity of our scheme is the least. Also, our scheme has a lower computation cost with (k+1)n modular exponentiations for sender and 3k modular exponentiations for the receiver. The security of our scheme is only based on the Decision Diffie-Hellman assumption. Further, we proved the sender’s computational security and the receiver’s unconditional security under standard model.
Oblivious transfer (OT) protocol is a fundamental building block of cryptography and can be applied widely in many fields. A secure oblivious transfer protocol is supposed to ensure the privacy of both senders and receivers. The privacy of receivers means that the information being selected by receivers would never be revealed to senders. On the other hand, the privacy of senders means that receivers have no further information except for the one that has been selected. In this case, senders are able to deceive receivers by sending same messages. Likewise, in existing 1-out-of-n OT protocols, malicious senders can make all the n messages the same, so that receivers will always get the specific one assigned by senders. This indicates that privacy of receivers wouldnt work under the 1-out-of-n OT protocol. To prevent this kind of attack, this paper provides a general framework on how to design a secure OT protocol based on commutative and ciphertext equality test and take RSA as an example to explain how the protocol is processed.
Due to the rapid development of internet in our daily life, protecting privacy has become a focus of attention. To create privacy-preserving database and prevent illegal user access the database, oblivious transfer with access control (OTAC) was proposed, which is a cryptographic primitive that extends from oblivious transfer (OT). It allows a user to anonymously query a database where each message is protected by an access control policy and only if the user' s attribute satisfy that access control policy can obtain it. In this paper, we propose a new protocol for OTAC by using elliptic curve cryptography, which is more efficient compared to the existing similar protocols. In our scheme, we also preserves user's anonymity and ensures that the user's attribute is not disclosed to the sender. Additionally, our construction guarantees the user to verify the correctness of messages recovered at the end of each transfer phase.
Oblivious transfer protocol,which is an important and useful cryptographic protocol,has been widely applied in cryptographic field,especially in construction of secure multi-party computation protocol.However,all of present oblivious transfer protocols have two drawbacks for requirement of their secrets: ① the receiver does not know whether message received is one of the messages held by the sender;② the sender does not know whether message received by the receiver is one of the messages designated by himself.In order to conquer these drawbacks,we firstly introduce the notion of verifiable oblivious transfer protocol,and firstly construct it by using proof protocol of knowledge,i.e.,∑-protocol,as main tool.
Hidden authentication conditional oblivious transfer based on oblivious attribute credentials(OACerts) and hidden credentials is proposed and a scheme based on bilinear pairing for implementing the idea is constructed which solves the problem that OACerts may exposure some sensitive information of the receiver.The scheme proposed has the property that only the receiver who has the required attribute credentials can open the message corresponding to its attribute value and that the receiver need not provide to the sender any credentials.The sender can not decide whether or not the receiver can open the messages and which message he can open.