搜索结果: 1-2 共查到“密码学 Computational Diffie-Hellman assumption”相关记录2条 . 查询时间(0.093 秒)
Trapdoor Functions from the Computational Diffie-Hellman Assumption
Trapdoor Functions Computational Diffie-Hellman Assumption
font style='font-size:12px;'>
2018/6/5
Trapdoor functions (TDFs) are a fundamental primitive in cryptography. Yet, the current set of assumptions known to imply TDFs is surprisingly limited, when compared to public-key encryption. We prese...
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
public key encryption CCA security the CDH assumption
font style='font-size:12px;'>
2009/6/4
Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public
key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computational
Diffie-Hellm...