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 Digital Contents Society

Adaptive Cryptographic Protocol for Fair Exchange of Secrets using Pseudo-Random-Sequence Generator

Soon-Gohn Kim

Published Jan 1, 2007• 2 citations
OpenAlex

Abstract

Abstract In this paper, I propose an adaptive cryptographic protocol which is basic protocol for fair exchange of secrets. For this, I investigate the verifiable oblivious transfer protocol based on discrete logarithm problem proposed by Lein Harn etc. And I propose a new adaptive cryptographic protocol that has the additional funtions on the existing method. This proposed method has the additional functions that enable to authenticate sender and to protect denial of what he/she has sent message to the other. To do this, I make use of bit commitment scheme using pseudo-random- sequence generator.Keywords : adaptive protocol, oblivious transfer, bit commitment, pseudo-random-sequence generator 1.서론 1.1공평한 비밀정보 교환 방법 최근 인터넷을 이용한 비즈니스 등의 전자상거래가 활성화 되고 있다. 이와 같이 네트워크상의 비즈니스가 활성화됨에 따라 여러 가지 업무, 특히 계약 등의 업무도 네트워크를 통해서 실현되고 있는 추세이다. 네트워크 기술이 발전됨에 따라 모든 일상생활속의 일을 분산환경 하에서 네트워크를 이용하여 실현하고자 하는 경향이 ※ 제일저자(First Author) : 김순곤접수일자:2007년09월14일, 심사완료:2007년09월28일* 중부대학교 컴퓨터학과sgkim@joongbu.ac.kr▣ 이 논문은 2006년도 중부대학교 학술연구개발비 지원에 의하여 이루어진 것임

Related papers

Efficient k-out-of-n Oblivious Transfer Schemes

Cheng Kang Chu, Wen-Guey Tzeng

Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme allows a buyer to privately choose k out of n digital goods from a merchant without learning information about other n−k goods. In this paper, we propose several efficient two-round k-out-of-n oblivious transfer schemes, in which the receiver R sends O(k) messages to the sender S, andS sends O(n) messages back to R. The schemes provide unconditional security for either sender or receiver. The computational security for the other side is based on the Decisional Diffie-Hellman (DDH) or Chosen-Target Computational Diffie-Hellman (CT-CDH) problems. Our schemes have the nice property of universal parameters, that is, each pair of R and S need not hold any secret before performing the protocol. The system parameters can be used by all senders and receivers without any trapdoor specification. In some cases, our OT k n schemes are the most efficient ones in terms of the communication cost, either in rounds or the number of messages. Moreover, one of our schemes is extended to an adaptive oblivious transfer scheme. In that scheme, S sends O(n) messages to R in one round in the commitment phase. For each query of R, onlyO(1) messages are exchanged and O(1) operations are performed. The preliminary version of this paper was published at PKC ’05 [Chu and Tzeng 2005].

•Jan 1, 2007•24 citations

Simulatable Adaptive Oblivious Transfer.

Jan L. Camenisch, Gregory Neven, Abhi A. Shelat

Abstract. We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to re-ceive k one-after-the-other, in such a way that (a) the sender learns noth-ing about the receiver’s selections, and (b) the receiver only learns about the k requested messages. We propose two practical protocols for this primitive that achieve a stronger security notion than previous schemes with comparable efficiency. In particular, by requiring full simulatabil-ity for both sender and receiver security, our notion prohibits a subtle selective-failure attack not addressed by the security notions achieved by previous practical schemes. Our first protocol is a very efficient generic construction from unique blind signatures in the random oracle model. The second construction does not assume random oracles, but achieves remarkable efficiency with only a constant number of group elements sent during each transfer. This second construction uses novel techniques for building efficient simulat-able protocols. 1

•Jan 1, 2008•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

Protocols for Message Authentication from a Weak Secret

Li Guo, Gang Yao

An authentication protocol is a procedure by which a sender tries to convey n bits of information, which we call an input message, to a receiver. An adversary controls the network over which the sender and the receiver talk and may change any message before it reaches its destination. This paper deals with the simple scenario where two parties, Alice and Bob, communicate and want to assure that the message received by Bob is the one sent by Alice. Unconditional cryptographic security cannot be generated simply from scratch, but must be based on some given primitive to start with. In this paper, we introduce a message authentication protocol with unconditional cryptographic security. More precisely, we give protocols using a weakly secret key allowing for the exchange of authenticated messages.

Applied Mechanics and Materials•Aug 30, 2013•0 citations

Proxy oblivious transfer protocol

Gang Yao, Feng Dengguo

Oblivious transfer protocol is an important primitive in modern cryptography. Since its introduction, the subject has attracted a lot of attentions and has become the basis for realizing a broad class of cryptographic protocols, such as secret key exchange, contract signing, secure function evaluation, oblivious keyword search, etc. This work describes protocols for proxy oblivious transfer, in which the role of the sender is divided between two proxies, and a receiver (chooser) must contact one proxy in order to run the oblivious transfer protocol and another for some extra information. This proxy oblivious transfer protocol provides a method for the sender to delegate a proxy to transfer one of his messages to a receiver on behalf of him. The proxy oblivious transfer protocol has the same security properties as the oblivious transfer protocol using in our protocol.

International Conference on Availability, Reliability and Security (ARES)•Jan 1, 2006•1 citation

Oblivious Transfer Protocol with Verification

Subhash C. Kak

Although random sequences can be used to generate probability events, they come with the risk of cheating in an unsupervised situation. In such cases, the oblivious transfer protocol may be used and this paper presents a variation to the DH key-exchange to serve as this protocol. A method to verify the correctness of the procedure, without revealing the random numbers used by the two parties, is also proposed.

arXiv:1504.00601•Apr 2, 2015•4 citations
Abstract In this paper, I propose an adaptive cryptographic protocol which is basic protocol for fair exchange of secrets. For this, I investigate the verifiable oblivious transfer protocol based on discrete logarithm problem proposed by Lein Harn etc. And I propose a new adaptive cryptographic protocol that has the additional funtions on the existing method. This proposed method has the additional functions that enable to authenticate sender and to protect denial of what he/she has sent message to the other. To do this, I make use of bit commitment scheme using pseudo-random- sequence generator.Keywords : adaptive protocol, oblivious transfer, bit commitment, pseudo-random-sequence generator 1.서론 1.1공평한 비밀정보 교환 방법 최근 인터넷을 이용한 비즈니스 등의 전자상거래가 활성화 되고 있다. 이와 같이 네트워크상의 비즈니스가 활성화됨에 따라 여러 가지 업무, 특히 계약 등의 업무도 네트워크를 통해서 실현되고 있는 추세이다. 네트워크 기술이 발전됨에 따라 모든 일상생활속의 일을 분산환경 하에서 네트워크를 이용하여 실현하고자 하는 경향이 ※ 제일저자(First Author) : 김순곤접수일자:2007년09월14일, 심사완료:2007년09월28일* 중부대학교 컴퓨터학과sgkim@joongbu.ac.kr▣ 이 논문은 2006년도 중부대학교 학술연구개발비 지원에 의하여 이루어진 것임
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme allows a buyer to privately choose k out of n digital goods from a merchant without learning information about other n−k goods. In this paper, we propose several efficient two-round k-out-of-n oblivious transfer schemes, in which the receiver R sends O(k) messages to the sender S, andS sends O(n) messages back to R. The schemes provide unconditional security for either sender or receiver. The computational security for the other side is based on the Decisional Diffie-Hellman (DDH) or Chosen-Target Computational Diffie-Hellman (CT-CDH) problems. Our schemes have the nice property of universal parameters, that is, each pair of R and S need not hold any secret before performing the protocol. The system parameters can be used by all senders and receivers without any trapdoor specification. In some cases, our OT k n schemes are the most efficient ones in terms of the communication cost, either in rounds or the number of messages. Moreover, one of our schemes is extended to an adaptive oblivious transfer scheme. In that scheme, S sends O(n) messages to R in one round in the commitment phase. For each query of R, onlyO(1) messages are exchanged and O(1) operations are performed. The preliminary version of this paper was published at PKC ’05 [Chu and Tzeng 2005].
Abstract. We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to re-ceive k one-after-the-other, in such a way that (a) the sender learns noth-ing about the receiver’s selections, and (b) the receiver only learns about the k requested messages. We propose two practical protocols for this primitive that achieve a stronger security notion than previous schemes with comparable efficiency. In particular, by requiring full simulatabil-ity for both sender and receiver security, our notion prohibits a subtle selective-failure attack not addressed by the security notions achieved by previous practical schemes. Our first protocol is a very efficient generic construction from unique blind signatures in the random oracle model. The second construction does not assume random oracles, but achieves remarkable efficiency with only a constant number of group elements sent during each transfer. This second construction uses novel techniques for building efficient simulat-able protocols. 1
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.
An authentication protocol is a procedure by which a sender tries to convey n bits of information, which we call an input message, to a receiver. An adversary controls the network over which the sender and the receiver talk and may change any message before it reaches its destination. This paper deals with the simple scenario where two parties, Alice and Bob, communicate and want to assure that the message received by Bob is the one sent by Alice. Unconditional cryptographic security cannot be generated simply from scratch, but must be based on some given primitive to start with. In this paper, we introduce a message authentication protocol with unconditional cryptographic security. More precisely, we give protocols using a weakly secret key allowing for the exchange of authenticated messages.
Oblivious transfer protocol is an important primitive in modern cryptography. Since its introduction, the subject has attracted a lot of attentions and has become the basis for realizing a broad class of cryptographic protocols, such as secret key exchange, contract signing, secure function evaluation, oblivious keyword search, etc. This work describes protocols for proxy oblivious transfer, in which the role of the sender is divided between two proxies, and a receiver (chooser) must contact one proxy in order to run the oblivious transfer protocol and another for some extra information. This proxy oblivious transfer protocol provides a method for the sender to delegate a proxy to transfer one of his messages to a receiver on behalf of him. The proxy oblivious transfer protocol has the same security properties as the oblivious transfer protocol using in our protocol.