承诺方案的研究

被引:4
作者
唐春明 [1 ]
刘卓军 [2 ]
机构
[1] 广州大学数学与信息科学学院
[2] 中国科学院数学与系统科学研究院
关键词
密码学; 承诺方案;
D O I
暂无
中图分类号
TN918.1 [理论];
学科分类号
070104 ;
摘要
承诺方案是一种重要而有用的密码学基本协议,它在密码学领域中的零知识证明、安全多方计算协议、电子货币、电子选举等众多密码学协议的构造中起着十分重要的作用.我们介绍了承诺方案的应用背景、定义、分类、构造以及它在密码学领域中所起的重要作用.同时,对目前密码学领域中关于承诺方案的研究热点也进行了阐述.
引用
收藏
页码:961 / 970
页数:10
相关论文
共 47 条
[21]  
Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the middle attacks. Gennaro R. Advances in CRYPTO‘04 . 2004
[22]  
Hybrid commitments and their applications to zero-knowledge proof systems. Catalano D,Visconti I. Journal of Theoretical Computer Science . 2007
[23]  
Statistical zero-knowledge arguments for NP from any one-way function. Nguyen M,Ong S J,Vadhan S. The 47th IEEE Symposium on FOCS . 2006
[24]  
Zero-knowledge with efficient provers. Nguyen M,Vadhan S. The 38th ACM STOC . 2006
[25]  
On sigma-protocols CPT 2004. Damgard I. http://www.daimi.au.dk/ivan/Sigma.ps .
[26]  
A discrete logarithm implementation of perfect zero- knowledge blobs. Boyar J,,Kurtz S A,Krentel M W. Journal of Cryptology . 1990
[27]  
Universal one-way hash functions and their cryptographic applications. Naor M,Yung M. Proc. 21st STOC . 1989
[28]  
One-way functions,hard on average problems,and statistical zero-knowledge proofs. Ostrovsky R. Proceedings of the 6th Annual Structure in Complexity Theory Conference . 1991
[29]  
Reducing complexity assumptions for statistically-hiding commitment. Haitner I,Horvitz O,Katz J,Koo C Y,Morselli R,Shaltei R. Proc.EUROCRYPT . 2005
[30]  
Secure Multi-Party Computation. Goldreich O. http://www.wisdom.weizmann.ac.il/oded/pp.html .