1,211 Hits in 5.0 sec

A New Efficient Digital Signature Scheme Algorithm based on Block cipher

Prakash Kuppuswamy
2012 IOSR Journal of Computer Engineering  
There are many other algorithms which are based on the hybrid combination of prime factorization and discrete logarithms, but different weaknesses and attacks have been developed against those algorithms  ...  Digital signature schemes are mostly used in cryptographic protocols to provide services like entity authentication, authenticated key transport and authenticated key agreement.  ...  Acknowledgement The authors are extremely express gratitude to the University President, JAZAN University, Kingdom of Saudi Arabia for inspiration and persistent support directly or indirectly for the  ... 
doi:10.9790/0661-0714752 fatcat:tbtvblputfg3pnhieuid4ojg3q

Convertible Authenticated Encryption Scheme Without Using Conventional One‐Way Function

Hung‐Yu Chien
2003 Informatica  
This paper shows a universal forgery attack on Araki et al.'s convertible authenticated encryption scheme, and proposes a new convertible authenticated encryption scheme.  ...  it becomes a publicly verifiable.  ...  s scheme and Wu-Hsu's scheme are based on the discrete logarithm problem and the conventional one-way functions.  ... 
doi:10.15388/informatica.2003.033 fatcat:u44tegjvfjg4lozdfxcdsqlwbi

Signcryption Scheme that Utilizes Elliptic Curve for both Encryption and Signature Generation

Ramratan Ahirwal, Anjali Jain, Y. K. Jain
2013 International Journal of Computer Applications  
Signcryption scheme based on elliptic curves represents a remarkable saving in computational cost and in communication overhead.  ...  In this paper a Signcryption scheme is suggested which is based on Elliptic Curve Cryptography (ECC).  ...  Gan, Li, and Chen proposed a publicly verifiable threshold signcryption method [11] which is based on DLP (Discrete Logarithm Problem) .  ... 
doi:10.5120/10112-4777 fatcat:pxaiwbzfajak3hqc54m4n6gq6m

Empirical Study of a Key Authentication Scheme in Public Key Cryptography

Kumaraswamy Palleboina
2017 International Journal of Engineering Research and Applications  
We developed a secure key authentication scheme based on discrete logarithms to avoid the drawbacks of earlier schemes.  ...  Earlier, many key authentication schemes are developed based on discrete logarithms. Each scheme has its own drawbacks.  ...  In 2014, A Provably Secure Signature Scheme based on Factoring and Discrete Logarithms developed by Zuhua Shao and and Yipeng Gao [4] .  ... 
doi:10.9790/9622-0703027986 fatcat:yo5q6xhw5naojmb57fxyuj7bya

Performance Comparison of Signcryption Schemes – A Step towards Designing Lightweight Cryptographic Mechanism

Anuj Kumar Singh, Patro B.D.K
2017 International Journal of Engineering and Technology  
The strength of these schemes depend upon the difficulty of solving any one problem namely IFP (Integer Factorization Problem), (DLP) Discrete Logarithmic Problem, ECDLP (Elliptic Curve Discrete Logarithmic  ...  Signcryption is a new way to achieve confidentiality and authentication simultaneously.  ...  Also these signcryption schemes are based on DLP (Discrete Logarithmic Problem), ECDLP (Elliptic Curve Discrete Logarithmic Problem) or BDHP (Bilinear Diffie Hellman Problem) [25] .  ... 
doi:10.21817/ijet/2017/v9i2/170902173 fatcat:jgcpm77nenfw3jkzb3hwtd4pbu

The design of dynamic access control scheme with user authentication

Sung-Ming Yen, Chi-Sung Laih
1993 Computers and Mathematics with Applications  
In this paper, we propose another dynamic access control scheme with integration of user authentication based on the computational difficulty of solving the discrete logarithm problem.  ...  Recently, Ham and Lin have first proposed a d3~ z~m;c access control scheme with combination of user authentication to prevent the possible separate security threats to these two protection modules.  ...  This motivates the authors to devise a scheme based on the discrete logarithm problem and differs from the previous works. l Author to whom correspondence should be addressed.  ... 
doi:10.1016/0898-1221(93)90309-j fatcat:dkenxssapncfpj7gvuxj72geny

Public Key Authentication Schemes for Local Area Networks

Tzung-Her Chen, Gwoboa Horng, Chuan-Sheng Yang
2008 Informatica  
Most of the key authentication schemes require one or more trustworthy authorities to authenticate the key of a user.  ...  and it uses a designated password authentication mechanism.  ...  A Key Authentication Scheme for Cryptosystems Based on Discrete Logarithms In this section, the first scheme based on discrete logarithms is proposed.  ... 
doi:10.15388/informatica.2008.198 fatcat:xcuddeu5kfbrtec5i7xi46lkqy

A Secure and Efficient Key Escrow Protocol for Mobile Communications [chapter]

Byung-Rae Lee, Kyung-Ah Chang, Tai-Yun Kim
2001 Lecture Notes in Computer Science  
We present a new construction for key escrow scheme, which compared to previous solutions by Chen, Gollman, Mitchell and later by Martin, achieves improvements in efficiency and security.  ...  key for end-to-end encryption.  ...  Wenbo [11] described a partial key escrow scheme based on Stadler's verifiable encryption [12] and the robust threshold cryptosystem [7] .  ... 
doi:10.1007/3-540-45545-0_52 fatcat:e4t5ghwltfgd7cor3xw2hdqf6q

Fingerprint Biometric-based Self-Authentication and Deniable Authentication Schemes for the Electronic World

MuhammadKhurram Khan
2009 IETE Technical Review  
For remedy, we propose two-factor-based self-authentication and deniable authentication schemes in which, firstly, each user has to perform self-authentication by something he knows (password) and something  ...  This paper presents fingerprint biometric-based self-authentication and deniable authentication schemes, which enable a receiver to identify source of the message but not to prove the identity of the sender  ...  [4] proposed two deniable authentication protocols based on the factoring and the discrete logarithm problem, respectively; however, their scheme also requires a trusted public directory.  ... 
doi:10.4103/0256-4602.50703 fatcat:ehbeyqdgsjhbdcxml2ycnafbki

LEES: a Hybrid Lightweight Elliptic ElGamal-Schnorr-Based Cryptography for Secure D2D Communications

Javeria Ambareen, M. Prabhakar, Tabassum Ara
2021 Journal of Telecommunications and Information Technology  
In this paper, we propose LEES, a secure authentication scheme using public key encryption for secure D2D communications in 5G IoT networks.  ...  The proposed scheme is characterized by low requirements concerning computation cost, storage and network bandwidth, and is immune to security threats, thus meeting confidentiality, authenticity, integrity  ...  It works on elliptic curves that are defined over a mathematical group and discrete logarithmic problems for its key formats.  ... 
doi:10.26636/jtit.2021.146020 fatcat:bu7ng6nq5vdg3finsw2rbxy6ke

A Fully Distributed Proactively Secure Threshold-Multisignature Scheme

Johann Van Der Merwe, Dawoud S. Dawoud, Stephen McDonald
2007 IEEE Transactions on Parallel and Distributed Systems  
The paper also proposes a discrete logarithm based distributed-key management infrastructure (DKMI), which consists of a round optimal, publicly verifiable, distributed-key generation (DKG) protocol and  ...  a one round, publicly verifiable, distributed-key redistribution/ updating (DKRU) protocol.  ...  The proposed scheme uses publicly verifiable encryption [15] , [22] that allows protocol participants to provide a zero knowledge proof of their public values' discrete logarithm.  ... 
doi:10.1109/tpds.2007.1005 fatcat:a5rjvg6lh5c3jo3kzz45zg7kau

New Construction of PVPKE Scheme and Its Application in Information Systems and Mobile Communication

Minqing Zhang, Xu An Wang, Xiaoyuan Yang, Weihua Li
2015 Mobile Information Systems  
Independently, we introduced a new cryptographic primitive, CCA-secure publicly verifiable public key encryption without pairings in the standard model (PVPKE), and discussed its application in proxy reencryption  ...  In this paper, we give new constructions ofPVPKEscheme based on signed quadratic residues and analyze their security.  ...  This work is supported by the National Natural Science Foundation of China under Contracts nos. 61103230, 61272492, 61103231, and 61202492.  ... 
doi:10.1155/2015/430797 fatcat:ptn2r6txrfhthluhw66z2cziba

Batch verifying multiple DSA-type digital signatures

L. Harn
1998 Electronics Letters  
., and YEUNG, M.M.: 'Analysis and synthesis for new digital video applications'. IEEE ICIP Conf.  ...  ., and YEO, B : 'Video visualisation for compact presentation and fast browsing of pictorial content', ZEEE Trans. Circuits Syst.  ...  factoring of a large integer into two large prime factors, and the ElGamal signature scheme [2] ; in which the difficulty of breaking the scheme is based on solving the discrete logarithm problem.  ... 
doi:10.1049/el:19980620 fatcat:pm6kwsatarhaffzjijwelrj3gm

A Strong Designated Verifiable DL Based Signcryption Scheme

Sujata Mohanty, Banshidhar Majhi
2012 Journal of Information Processing Systems  
The security of the proposed scheme lies in the complexity of solving two computationally hard problems, namely, the Discrete Logarithm Problem (DLP) and the Integer Factorization Problem (IFP).  ...  This paper presents a strong designated verifiable signcryption scheme, in which a message is signcrypted by a signcryptor and only a specific receiver, who called a "designated verifier", verifies it  ...  In this scheme, the public key generation of both signcryptor and designated receiver are based upon the complexity of solving discrete logarithm problem.  ... 
doi:10.3745/jips.2012.8.4.567 fatcat:jas2ikagfjaptdeby2wfmebcre


2014 American Journal of Applied Sciences  
It is observed that ECC based certificate authority schemes gives better speed and security. Elliptic curve based schemes are the best for time and resource constrained wireless applications.  ...  Elliptic curve based systems can give better security compared to RSA with less key size. This study compares the performance of ECC based signature schemes and RSA schemes using NS2 simulation.  ...  As the proposed method is based on the strength of the elliptic curve discrete logarithm problem, it is not vulnerable for cryptanalytic attacks which are readily available.  ... 
doi:10.3844/ajassp.2014.171.179 fatcat:etivtwaf25hhthqvfduq2og75i
« Previous Showing results 1 — 15 out of 1,211 results