Filters








1,737 Hits in 5.9 sec

Secure Hashed Diffie-Hellman over Non-DDH Groups [chapter]

Rosario Gennaro, Hugo Krawczyk, Tal Rabin
2004 Lecture Notes in Computer Science  
doi:10.1007/978-3-540-24676-3_22 fatcat:giwpngrsandwbal6zijwbk6p2y

Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes [chapter]

Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Sébastien Zimmer
2006 Lecture Notes in Computer Science  
This allows us to show that under the Decisional Diffie-Hellman assumption we can deterministically derive a uniformly random bit-string from a Diffie-Hellman exchange in the standard model.  ...  In this paper we introduce very simple deterministic randomness extractors for Diffie-Hellman distributions.  ...  Under the decisional Diffie-Hellman assumption (DDH) one can securely agree on a random and private element.  ... 
doi:10.1007/11787006_21 fatcat:ntab2wlsbnelviqufvpsjfivre

Randomness extraction in finite fields F_{p^n}

Abdoul Aziz Ciss, Djiby Sow
2013 International Journal of Algebra  
Hence, under the Decisional Diffie-Hellman assumption over binary fields, one can deterministically derive a uniformly random bit-string from a Diffie-Hellman key exchange in the standard model.  ...  Our proposition is a good deterministic extractor even if the length of its output is less than those one can have with the leftover hash lemma and universal hash functions.  ...  The security of the Diffie-Hellman exchange relies on the Diffie-Hellman assumption (DDH) [2] , which states that there is no efficient algorithm that can distinguish the two distributions (g a , g b  ... 
doi:10.12988/ija.2013.2566 fatcat:lawrulspczdj3e2p7457zmisge

A simple deniable authentication protocol based on the Diffie–Hellman algorithm

Rongxing Lu, Xiaodong Lin, Zhenfu Cao, Liuquan Qin, Xiaohui Liang
2008 International Journal of Computer Mathematics  
In this paper, based on the Diffie-Hellman algorithm, we propose a new simple deniable authentication protocol from a provably secure simple user authentication scheme.  ...  Deniable authentication protocol is a new authentication mechanism in secure computer communication, which not only enables an intended receiver to identify the source of a received message but also prevents  ...  (DDH) problem and the Hash Diffie-Hellman (HDDH) problem [1] .  ... 
doi:10.1080/00207160701622741 fatcat:ay3woc4f5rfmzin4c7fkejewpi

Provably authenticated group Diffie-Hellman key exchange

Emmanuel Bresson, Olivier Chevassut, David Pointcheval, Jean-Jacques Quisquater
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
We then define in this model the execution of an authenticated group Diffie-Hellman scheme and prove its security. The second author was supported by the Director, Office  ...  Group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to provide a pool of players with a shared secret key which may later be used, for example, to achieve multicast message  ...  The Group Decisional Diffie-Hellman (G-DDH) assumption.  ... 
doi:10.1145/501983.502018 dblp:conf/ccs/BressonCPQ01 fatcat:b6sa6dnomnbibkjrkwpny6wkxq

Provably authenticated group Diffie-Hellman key exchange

Emmanuel Bresson, Olivier Chevassut, David Pointcheval, Jean-Jacques Quisquater
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
We then define in this model the execution of an authenticated group Diffie-Hellman scheme and prove its security. The second author was supported by the Director, Office  ...  Group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to provide a pool of players with a shared secret key which may later be used, for example, to achieve multicast message  ...  The Group Decisional Diffie-Hellman (G-DDH) assumption.  ... 
doi:10.1145/502014.502018 fatcat:nxjrht6a2bbixlmacproi5d4gy

Two-round contributory group key exchange protocol for wireless network environments

Tsu-Yang Wu, Yuh-Min Tseng, Ching-Wen Yu
2011 EURASIP Journal on Wireless Communications and Networking  
Under the decision Diffie-Hellman (DDH), the computation Diffie-Hellman (CDH), and the hash function assumptions, we demonstrate that the proposed protocol is secure against passive attack and provides  ...  Hence, GKE protocols can be used to provide secure group communication over a public network channel.  ...  Under the decision Diffie-Hellman (DDH), the computation Diffie-Hellman (CDH), and the hash function assumptions, we have proven that the proposed protocol is secure against passive attacks and provides  ... 
doi:10.1186/1687-1499-2011-12 fatcat:rxdbnhnfxbdzvluwhpsfb7ablu

Using Hash Functions as a Hedge against Chosen Ciphertext Attack [chapter]

Victor Shoup
2000 Lecture Notes in Computer Science  
if the Decisional Diffie-Hellman assumption is true; we give strong evidence that the scheme is secure if the weaker, Computational Diffie-Hellman assumption is true by providing a proof of security in  ...  Although this is a reasonable intractability assumption, it would be preferable to base a security proof on a weaker assumption, such as the Computational Diffie-Hellman assumption.  ...  Other Diffie-Hellman based encryption schemes.  ... 
doi:10.1007/3-540-45539-6_19 fatcat:qpfkgh6kpfegvhdwcdisxbdoza

The Group of Signed Quadratic Residues and Applications [chapter]

Dennis Hofheinz, Eike Kiltz
2009 Lecture Notes in Computer Science  
That is, in this group the Diffie-Hellman problem is hard, even in the presence of a Decisional Diffie-Hellman oracle.  ...  Concretely, we consider the security of the scheme when instantiated over the group of signed quadratic residues.  ...  Other Applications Security of Diffie-Hellman key exchange.  ... 
doi:10.1007/978-3-642-03356-8_37 fatcat:5j7bx5g6jfejtngcbngeuskpc4

Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems

Eu-Jin Goh, Stanislaw Jarecki, Jonathan Katz, Nan Wang
2007 Journal of Cryptology  
Given current state of the art, it is as difficult to solve the Diffie-Hellman problems as it is to solve the discrete logarithm problem in many groups of cryptographic interest.  ...  Diffie-Hellman problem, a stronger assumption.  ...  Our second scheme is more efficient, but its security is based on the stronger decisional Diffie-Hellman (DDH) assumption. See Section 2.2 for formal definitions of these two assumptions.  ... 
doi:10.1007/s00145-007-0549-3 fatcat:feedaq6qjvew7itnhhed6c7huu

A Simple Threshold Authenticated Key Exchange from Short Secrets [chapter]

Michel Abdalla, Olivier Chevassut, Pierre-Alain Fouque, David Pointcheval
2005 Lecture Notes in Computer Science  
We denote by U the set of all participants (i.e., U = C ∪ G ∪ S) and by U a non-specific participant in U. Each client C ∈ C holds a password pw C .  ...  The goal in this setting is to achieve both transparency and security for the client.  ...  Such attacks are not currently taken into account by our security model.  ... 
doi:10.1007/11593447_31 fatcat:rblad7olofdh7ekrvezphm5z5q

Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems*

Eu-Jin Goh, Stanis law Jarecki, Jonathan Katz, NAN WANG
2008 Social Science Research Network  
Given current state of the art, it is as difficult to solve the Diffie-Hellman problems as it is to solve the discrete logarithm problem in many groups of cryptographic interest.  ...  Diffie-Hellman problem, a stronger assumption.  ...  Our second scheme is more efficient, but its security is based on the stronger decisional Diffie-Hellman (DDH) assumption. See Section 2.2 for formal definitions of these two assumptions.  ... 
doi:10.2139/ssrn.1157406 fatcat:rdrxgdjh2bhivewzdjnuig34s4

A novel deniable authentication protocol based on Diffie-Hellman algorithm using pairing technique

Jayaprakash Kar, Banshidhar Majhi
2011 Proceedings of the 2011 International Conference on Communication, Computing & Security - ICCCS '11  
This paper describes a new deniable authentication protocol whose security is based Diffe-Hellman (CDH) Problem of type Decisional Diffie-Hellman(DDH) and the Hash Diffie-Hellman (HDDH) problem.  ...  This property is very useful for providing secure negotiation over the internet.  ...  The security of our protocol is based on Computational Diffie-Hellman (CDH), Decisional Diffie-Hellman (DDH) and the Hashed Diffie-Hellman (HDDH) Problems.In this section, we analyze the security of our  ... 
doi:10.1145/1947940.1948042 dblp:conf/icccs/KarM11 fatcat:znaquyp74zb6ljfawtyectsjm4

Novel Constructions of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family

Jing Li, Licheng Wang, Zonghua Zhang, Xinxin Niu
2016 Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security - ASIA CCS '16  
Moreover, we propose a secure outsourcing method for the encryption of the non-abelian analog based on the factorization problem over non-commutative groups.  ...  At TCC 2005, Vasco et al. proposed a method for building Cramer-Shoup like cryptosystem over non-abelian groups and raised an open problem for finding a secure instantiation.  ...  Similarly, the corresponding decisional Diffie-Hellman like versions are given below: • Decisional Diffie-Hellman Conjugacy Problem (DDH-CP): Given a non-abelian group G and a quintuple (g, h, g1 = h x  ... 
doi:10.1145/2897845.2897920 dblp:conf/ccs/LiWZN16 fatcat:3wkutc3vzjdrvoogx2yfy6odqy

Security Analysis of Public Key Encryptions Based on Conjugacy Search Problem [chapter]

Akihiro Yamamura
2014 Lecture Notes in Computer Science  
function and the leftover hash lemma.  ...  It does not satisfy the security property claimed as it is. We also discuss imperfections of security proofs of the other proposals: CSP-hElG and CSP-CS schemes.  ...  In addition, we shall fix the CSP-ElG using the Gennaro, Krawczyk and Rabin's technique to smooth the distribution of outputs of DH transform over non-DDH group [5] using the leftover hash lemma [2,  ... 
doi:10.1007/978-3-642-55032-4_57 fatcat:wyu7hfp5gfgllkapzdpridehxy
« Previous Showing results 1 — 15 out of 1,737 results