Results 81 to 90 of about 6,041 (213)
Tight Reductions among Strong Diffie-Hellman Assumptions [PDF]
, 2005 We derive some tight equivalence reductions between several Strong Diffie-Hellman (SDH ...
Victor K. Wei
core
Efficient signcryption with key privacy from gap Diffie-Hellman groups
, 2004 This paper proposes a new public key authenticated encryption (signcryption) scheme based on the Diffie-Hellman problem in Gap Diffie-Hellman groups.
Libert, Benoît +2 more
core +1 more source
Implementasi Protokol Diffie-Hellman Dan Algoritma RC4 Untuk Keamanan Pesan SMS
IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 2015 Abstrack— SMS now becomes such a need for cellular phone users to communicate to other people. But the cellular phone users do not realize that the sent messages could be intercepted or changed by an unwanted party.
Decky Hendarsyah, Retantyo Wardoyo
doaj +1 more source
Safeguarding images over insecure channel using master key visual cryptopgraphy
Ain Shams Engineering Journal, 2018 Sharing secrets and safeguarding them while being sent over insecure channel is a crucial matter. Visual Cryptography still has the strong potential to secure this critical issue.
May A. Salama +2 more
doaj +1 more source
On the q-Strong Diffie-Hellman Problem [PDF]
, 2010 This note is an exposition of reductions among the q-strong Diffie-Hellman problem and related ...
Naoki Tanaka, Taiichi Saito
core
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
Certificateless strong designated verifier multi-signature
Tongxin xuebao, 2016 In order to satisfy the application requirements in the fields of judicial administration,e-government,etc.,the definition and security model for certificateless strong designated verifier multi-signature were proposed.Then,the first certificateless ...
Hong-zhen DU, Qiao-yan WEN
doaj +2 more sources
The Static Diffie-Hellman Problem
, 2005 The static Diffie-Hellman problem (SDHP) is the special case of the classic Diffie-Hellman problem where one of the public keys is fixed. We establish that the SDHP is almost as hard as the associated discrete logarithm problem.
Daniel R. L. Brown, Robert P. Gallant
core
Improved signcryption from q-Diffie-Hellman problems
, 2005 This paper proposes a new public key authenticated encryption (signcryption) scheme based on the hardness of q-Diffie-Hellman problems in Cap Diffie-Hellman groups, This new scheme is quite efficient: the signcryption operation has almost the same cost ...
4th International Conference on Security in Communication Networks +2 more
core
Diffie-Hellman Key Exchange through Steganographied Images
, 2018 Purpose ”“ In a private key system, the major problem is the exchange of the key between the two parties. Diffie and Hellman have set up a way to share the key.
Khaldi, Amine
core +1 more source