您要查找的是不是：
- 计算性Diffie-Hellman问题computational Diffie-Hellman problem
- 随后,本文讨论了混合可验证加密签名体制的安全模型,并在随机谕示模型下,基于双线性映射的计算性D iffie-Hellman问题难解性假设,证明本文体制是可证安全的.Then,we provide some theoretical discussions for the security model for MVESSs,and show that our new scheme can be proven to secure with the hardness assumption of the computational Diffie-Hellman problem of pairings in the random oracle model.
- 计算Difiie-Hellman问题computational Diffie-Hellman problem
- 计算Diffie.Hellman问题computational Diffie-Hellman problem
- 关于实数的可计算性On the computability of real numbers
- 没问题No problem.
- 知性intellectuality
- 安全问题safety issue
- 计算Diffie-Hellman（CDH）假设computational Diffie-HeUman assumption
- 耐久性wear
- 保障性indemnificatory
- 没有问题all serene
- 密钥可用于确定密钥协议,如使用Diffie-Hellman密钥协议算法创建的密钥。The key can be used to determine key agreement, such as a key created using the Diffie-Hellman key agreement algorithm.
- 敏感性sensibility
- 常见问题FAQ
- 整体性globality
- 处理问题handling problem
- 鲁棒性robustness
- 出现问题go wrong
- 能行可计算性函数渐进优超等价类的可达性质ON ACCESSIBLE PROPERTIES OF EQUIVALENCE CLASSES OF EFFECTIVE COMPUTABLE FUNCTIONS
