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

Journal of Xidian University

Hidden authentication conditional oblivious transfer

Xinguo Li

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

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.

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

Oblivious transfer protocol with access control

YU Zhao-ping

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.

Computer Engineering and Applications Journal•Jan 1, 2007•0 citations

k out of n Oblivious Transfer Protocols from Bilinear Pairings

Jing Qin, Huawei Zhao

T wo non-interactive three parties k out of n oblivious transfer protocols from bilinear pairings are proposed i n this paper. In these protocols , a sender can obliviously transfer n messages to a receiver without communication with him/her. The public keys that a sender used to encrypt his/her messages are made by a third party. The receiver can extract k out of n messages at his/her choices by using the corresponding secret keys. The choices of the receiver are unconditionally secure. The sender's secrecy is guaranteed if the receiver is semi-honest in the standard model since the decision bilinear Diffie-Hellman problem (DBDH) is hard and the sender's secrecy is achieved when the receiver is a malicious party in the random oracle model since the bilinear Diffie-Hellman problem assumption (BDHA) holds. When a sender is a cheating party, the receiver will detect him/her and halt the protocol. A precise proof of the security of the protocols is presented.

Journal of Software•Dec 14, 2009•3 citations

Non-interactive Oblivious Transfer Protocols

Jing Qin, Zhao Huawei, Mingqiang Wang

Two novel constructions of one out of n oblivious transfer protocols from bilinear maps between groups are proposed. The protocols satisfy the category of non-interactive, mean that any sender S can obliviously transfer some secret(s) to a receiver R, but R does not send any messages back to S. The choice of a receiver is unconditionally secure. A sender's secrecy is guaranteed if the receiver is semi-honest in a standard model since the decision bilinear Diffie-Hellman problem is hard and the sender's secrecy is achieved when the receiver is a malicious party in a random oracle model since the bilinear Diffie-Hellman problem assumption holds. When a sender is a cheating party, the receiver will detect him/her and halt the protocol. A precise proof of the security of the protocols is presented.

International Forum on Information Technology and Applications•May 1, 2009•3 citations

Adaptive Oblivious Transfer with Hidden Access Policy Realizing Disjunction

Vandana Guleria, Ratna Dutta

We propose an efficient adaptive oblivious transfer protocol with hidden access policies. This scheme allows a receiver to anonymously recover a message from a database which is protected by hidden attribute based access policy if the receiver's attribute set satisfies the associated access policy implicitly. The proposed scheme is secure in the presence of malicious adversary under the q-Strong Diffie-Hellman (SDH), q-Power Decisional Diffie-Hellman (PDDH) and Decision Bilinear Diffie-Hellman (DBDH) assumption in full-simulation security model. The scheme covers disjunction of attributes. The proposed protocol outperforms the existing similar schemes in terms of both communication and computation.

International Conference on Security and Cryptography•Jan 1, 2014•3 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
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.
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.
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.
T wo non-interactive three parties k out of n oblivious transfer protocols from bilinear pairings are proposed i n this paper. In these protocols , a sender can obliviously transfer n messages to a receiver without communication with him/her. The public keys that a sender used to encrypt his/her messages are made by a third party. The receiver can extract k out of n messages at his/her choices by using the corresponding secret keys. The choices of the receiver are unconditionally secure. The sender's secrecy is guaranteed if the receiver is semi-honest in the standard model since the decision bilinear Diffie-Hellman problem (DBDH) is hard and the sender's secrecy is achieved when the receiver is a malicious party in the random oracle model since the bilinear Diffie-Hellman problem assumption (BDHA) holds. When a sender is a cheating party, the receiver will detect him/her and halt the protocol. A precise proof of the security of the protocols is presented.
Two novel constructions of one out of n oblivious transfer protocols from bilinear maps between groups are proposed. The protocols satisfy the category of non-interactive, mean that any sender S can obliviously transfer some secret(s) to a receiver R, but R does not send any messages back to S. The choice of a receiver is unconditionally secure. A sender's secrecy is guaranteed if the receiver is semi-honest in a standard model since the decision bilinear Diffie-Hellman problem is hard and the sender's secrecy is achieved when the receiver is a malicious party in a random oracle model since the bilinear Diffie-Hellman problem assumption holds. When a sender is a cheating party, the receiver will detect him/her and halt the protocol. A precise proof of the security of the protocols is presented.
We propose an efficient adaptive oblivious transfer protocol with hidden access policies. This scheme allows a receiver to anonymously recover a message from a database which is protected by hidden attribute based access policy if the receiver's attribute set satisfies the associated access policy implicitly. The proposed scheme is secure in the presence of malicious adversary under the q-Strong Diffie-Hellman (SDH), q-Power Decisional Diffie-Hellman (PDDH) and Decision Bilinear Diffie-Hellman (DBDH) assumption in full-simulation security model. The scheme covers disjunction of attributes. The proposed protocol outperforms the existing similar schemes in terms of both communication and computation.
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.