1) computational Differ-Hellman problem
计算Differ-Hellman问题
1.
The security of our scheme is based on the fact that computational Differ-Hellman problem is hard.
它的安全性建立在计算Differ-Hellman问题的困难性之上。
2) computational diffie-hellman problem
计算Diffie-Hellman问题
1.
The security of the scheme is based on the fact that computational Diffie-Hellman problem is hard.
分析显示该方案满足环签名的各种安全性要求,它的安全性基于计算Diffie-Hellman问题的困难性,可广泛地应用于电子选举、电子拍卖等方面。
2.
It is proved secure in the random oracle models with the assumption that the computational Diffie-Hellman problem is infeasible.
它的安全性建立在计算Diffie-Hellman问题的困难性之上。
3.
A new and efficient signature scheme is proposed,and its security is reduced to computational Diffie-Hellman problem without using forking reduction tech-nology.
提出了一个新的、有效的签名方案,并在安全证明不使用分叉归约技术的情况下将它的安全性归约到计算Diffie-Hellman问题的安全性。
3) computational bilinear Diffie-Hellman problem
计算双线性Diffie-Hellman问题
4) Diffie-Hellman problem
Diffie-Hellman问题
5) Decision diffie-hellman assumption
DecisionDiffie-Hellman问题
6) Diffle-Hellman Problems
Diffle-Hellman问题
补充资料：计算
①根据已知数通过数学方法求得未知数：～人数 ㄧ～产值。②考虑；筹划：做事没个～，干到哪儿算哪儿。③暗中谋划损害别人：当心被小人～。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条