| 可判定条件下的零知识证明 |
| |
| 引用本文： | 韩德,李慧珍,戚英华. 可判定条件下的零知识证明[J]. 装甲兵工程学院学报, 2009, 23(2): 92-94 |
| |
| 作者姓名： | 韩德 李慧珍 戚英华 |
| |
| 作者单位： | 1. 装甲兵工程学院,非线性科学研究所,北京,100072
2. 重庆工程职业技术学院,经济管理系,重庆,400037 |
| |
| 摘 要： | 零知识证明是密码学关注的问题之一。在可判定条件下，运用代数学中群的共轭性质进行零知识证明，其实例就是数学中关于寻找共轭子的困难性问题。
|
| 关 键 词： | 零知识证明 共轭 辫群 判定 |
Zero-knowledge Decidable under the Interpretable Condition |
| |
| HAN De,LI Hui-zhen,QI Ying-hua. Zero-knowledge Decidable under the Interpretable Condition[J]. Journal of Armored Force Engineering Institute, 2009, 23(2): 92-94 |
| |
| Authors: | HAN De LI Hui-zhen QI Ying-hua |
| |
| Affiliation: | 1. Institute of Nonlinear Science, Academy of Armored Force Engineering, Beijing 100072, China; 2. Department of Economics and Management, Institute of Chongqing Vocational Engineering, Chongqing 400037, China) |
| |
| Abstract: | Zero-knowledge verification is one of problems concerning cryptography. This paper presents, under decidable conditions, zero-knowledge verification with group conjugacy in algebras is an instance of the difficult problems in finding conjugators in mathematics. |
| |
| Keywords: | zero-knowledge verification conjugation braid group decision |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
