BIT COMMITMENT USING PSEUDO-RANDOM SYNTHESIZER  

BIT COMMITMENT USING PSEUDO-RANDOM SYNTHESIZER

在线阅读下载全文

作  者:Zheng Dong Liu Shengli Wang Yumin (ISN Key Lab., Xidian University, Xi’an 710071) 

出  处:《Journal of Electronics(China)》1999年第4期372-375,共4页电子科学学刊(英文版)

摘  要:This paper presents two practical message commitment schemes: one is suitable for committing many bits, and another is useful for committing any bit-long message. They are provably secure based on pseudo-random synthesizers. In these schemes, the sender may be unbounded to polynomial time and the receiver is bounded. The advantage of these schemes is that the secure parameter may be small.This paper presents two practical message commitment schemes: one is suitable for committing many bits, and another is useful for committing any bit-long message. They are provably secure based on pseudo-random synthesizers. In these schemes, the sender may be unbounded to polynomial time and the receiver is bounded. The advantage of these schemes is that the secure parameter may be small.

关 键 词:BIT COMMITMENT PSEUDO-RANDOM SYNTHESIZER 

分 类 号:TN918[电子电信—通信与信息系统]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象