您要查找的是不是：
- 計算性Diffie-Hellman問(wèn)題computational Diffie-Hellman problem
- 隨后,本文討論了混合可驗證加密簽名體制的安全模型,并在隨機諭示模型下,基于雙線(xiàn)性映射的計算性D iffie-Hellman問(wèn)題難解性假設,證明本文體制是可證安全的.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問(wèn)題computational Diffie-Hellman problem
- 計算Diffie.Hellman問(wèn)題computational Diffie-Hellman problem
- 關(guān)于實(shí)數的可計算性On the computability of real numbers
- 沒(méi)問(wèn)題No problem.
- 知性intellectuality
- 安全問(wèn)題safety issue
- 計算Diffie-Hellman（CDH）假設computational Diffie-HeUman assumption
- 耐久性wear
- 保障性indemnificatory
- 沒(méi)有問(wèn)題all serene
- 密鑰可用于確定密鑰協(xié)議,如使用Diffie-Hellman密鑰協(xié)議算法創(chuàng )建的密鑰。The key can be used to determine key agreement, such as a key created using the Diffie-Hellman key agreement algorithm.
- 敏感性sensibility
- 常見(jiàn)問(wèn)題FAQ
- 整體性globality
- 處理問(wèn)題handling problem
- 魯棒性robustness
- 出現問(wèn)題go wrong
- 能行可計算性函數漸進(jìn)優(yōu)超等價(jià)類(lèi)的可達性質(zhì)ON ACCESSIBLE PROPERTIES OF EQUIVALENCE CLASSES OF EFFECTIVE COMPUTABLE FUNCTIONS
