Bit Commitment Using Pseudo-Randomness

Moni Naor

Dong Zheng, Shengli Liu, Yumin Wang

Himanshu Tyagi, Shun Watanabe

Yanhui Wu, Jianer Chen

Based on analyzing the scheme of bit commitment,which is provided on a pseudo-random generator,from the literature~([1]),This paper discuss a pattern of interaction attack which aims at the course of bit commitment,and provides a safe scheme based on the scheme of bit commitment.Holded the security of that scheme,the safe scheme imports one-way hash function and authentication,protects the datas from man-in-the-middle attack during the transmission course.

Moni Naor

Soon-Gohn Kim

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년도 중부대학교 학술연구개발비 지원에 의하여 이루어진 것임