Skip to search formSkip to main contentSkip to account menu

Computational Diffie–Hellman assumption

Known as: CDH, Computational Diffie-Hellman assumption 
The computational Diffie–Hellman (CDH assumption) is the assumption that a certain computational problem within a cyclic group is hard. Consider a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
An Identity-based encryption (IBE) simplifies key management by taking users’ identities as public keys. However, how to… 
2015
2015
This paper investigates authenticated key exchange (AKE) protocol under computational Diffie–Hellman assumption in the extended… 
2012
2012
LaMacchia, Lauter and Mityagin [19] proposed a novel security definition for authenticate key exchange (AKE) that gives an… 
2008
2008
In this paper, we propose a new attribute-based proxy re-encryption scheme, where a semi-trusted proxy, with some additional… 
2006
2006
We describe a practical identity-based encryption scheme that is secure in the standard model againstchosen-ciphertext(IND-CCA2… 
2005
2005
Let p be a finite field of p elements, where p is prime. The bit security of the Diffie-Hellman function over subgroups of *p and… 
2000
2000
CDC6 is conserved during evolution and is essential and limiting for the initiation of eukaryotic DNA replication. Human CDC6…