Results 11 to 20 of about 1,230 (176)
Algebraic generalization of Diffie–Hellman key exchange [PDF]
Journal of Mathematical Cryptology, 2018 The Diffie–Hellman key exchange scheme is one of the earliest and most widely used public-key primitives. Its underlying algebraic structure is a cyclic group and its security is based on the discrete logarithm problem (DLP).
Partala Juha
doaj +2 more sources
The Group Diffie-Hellman Problems [PDF]
, 2002 In this paper we study generalizations of the Diffie-Hellman problems recently used to construct cryptographic schemes for practical purposes. The Group Computational and the Group Decisional Diffie-Hellman assumptions not only enable one to construct ...
Chevassut, Olivier +5 more
core +2 more sources
Rate-1 Trapdoor Functions from the Diffie-Hellman Problem [PDF]
, 2019 Trapdoor functions (TDFs) are one of the fundamental building blocks in cryptography. Studying the underlying assumptions and the efficiency of the resulting instantiations is therefore of both theoretical and practical interest.
Sanjam Garg (17432640) +4 more
core +2 more sources
Identity-based Encryption from the Diffie-Hellman Assumption
, 2021 We provide the first constructions of identity-based encryption and hierarchical identity-based encryption based on the hardness of the (Computational) Diffie-Hellman Problem (without use of groups with pairings) or Factoring.
Garg, Sanjam, Döttling, Nico
core +2 more sources
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions [PDF]
, 2002 . Authenticated Diffie-Hellman key exchange allows two principals communicating over a public network, and each holding public/private keys, to agree on a shared secret value.
Chevassut, Olivier +5 more
core +1 more source
Variants of the Diffie-Hellman Problem
, 2018 Many variations of the Diffie-Hellman problem exist that can be shown to be equivalent to one another. We consider following variations of Diffie-Hellman problem: square computational and Square decisional Diffie-Hellman problem, inverse computational ...
Kannan Balasubramanian
core +1 more source
Secure communication mechanism for VSN based on certificateless signcryption
Tongxin xuebao, 2021 To solve the communication security problems of vehicular social network (VSN), an efficient certificateless signcryption scheme was proposed.The proposed scheme was proven secure in the random oracle model based on the computational Diffie-Hellman ...
Wenbo ZHANG, Wenhua HUANG, Jingyu FENG
doaj +2 more sources
Privacy-Aware Secure Anonymous Communication Protocol in CPSS Cloud Computing
IEEE Access, 2020 Cloud computing has emerged as a promising paradigm for the Internet of Things (IoT) and Cyber-Physical-Social Systems (CPSS). However, the problem of how to ensure the security of data transmission and data storage in CPSS is a key issue to address.
Fengyin Li +6 more
doaj +1 more source
Provably secure partially blind signature without trusted PKG
Tongxin xuebao, 2010 Using gap Diffie-Hellman groups, based partially blind signature scheme, an efficient ID-based partially blind signature scheme without trusted private key generator （PKG） was proposed.
FENG Tao1, PENG Wei1, MA Jian-feng3
doaj +2 more sources
A Probability‐Aware AI Framework for Reliable Anti‐Jamming Communication
CAAI Transactions on Intelligence Technology, Volume 11, Issue 2, Page 349-366, April 2026.ABSTRACT Adversarial jamming attacks have increased on communication systems, causing distortion and threatening transmissions. Typical attacks rely on traditional, well‐defined cryptographic protocols and frequency‐hopping techniques. Nevertheless, these techniques become vulnerable when facing intelligent jammers.
Tawfeeq Shawly, Ahmed A. Alsheikhy
wiley +1 more source