搜索结果: 1-4 共查到“军事学 computational Diffie-Hellman”相关记录4条 . 查询时间(0.148 秒)
Trapdoor Functions from the Computational Diffie-Hellman Assumption
Trapdoor Functions Computational Diffie-Hellman Assumption
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...
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
Efficient Public-Key Encryption Computational Diffie-Hellman Standard Model
2010/2/1
This paper proposes practical chosen-ciphertext secure public-key encryption systems that
are provably secure under the computational Die-Hellman assumption, in the standard model.
Our schemes are ...
Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem
Authenticated key exchange CDH problem Twin DH problem Trapdoor test
2009/6/10
Currently, there are a lot of authenticated key exchange
(AKE) protocols in literature. However, the security proofs of this kind
of protocols have been established to be a non-trivial task. The mai...
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
public key encryption CCA security the CDH assumption
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...