A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Filters
A Signcryption Scheme Based on Integer Factorization
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
We propose a new signcryption scheme which gives a partial solution to an open problem posed by Zheng, namely to find a signcryption scheme based on the integer factorization problem. ...
Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable origin authenticity, at a lower computational and communication ...
Consistent with this approach, Zheng posed, in his original paper [17] , the open problem of finding a signcryption scheme based on the integer factorization problem, which appears to be computationally ...
doi:10.1007/3-540-44456-4_23
fatcat:vfth43axlvbdxkgrhe2dnqrdfa
A new efficient strong proxy signcryption scheme based on a combination of hard problems
2009
2009 IEEE International Conference on Systems, Man and Cybernetics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we propose a new proxy signcryption scheme which has the following advantages as compared to the previous schemes: (1) It is based on a combination of hard problems: Integer Factorization ...
Proxy signcryption scheme is the combination of proxy signature and encryption. ...
But it is desirable to design a proxy signcryption scheme based on other problem, such as Integer Factorization Problem (IFP). ...
doi:10.1109/icsmc.2009.5346018
dblp:conf/smc/ElkamchouchiNE09
fatcat:ugtdmrhe5nfw3n5oknk7wac2re
Identification, Signature and Signcryption Using High Order Residues Modulo an RSA Composite
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
This contributes to the research of extending computational underpinnings of signcryption schemes to problems related to integer factorization. ...
The concept of signcryption, together with an implementation based on the discrete logarithm problem, was proposed in 1996. ...
Acknowledgment Thanks to Ron Steinfeld for various discussions on selecting security parameters for the schemes. Thanks also to PKC2001 Program Committee members for their helpful comments. ...
doi:10.1007/3-540-44586-2_4
fatcat:mkbyymjd4nfzpf4wdu3xw5zl4q
Combining Public Key Encryption with Schnorr Digital Signature
2012
Journal of Software Engineering and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
This article presents a new signcryption scheme which is based on the Schnorr digital signature algorithm. The new scheme represents my personal contribution to signcryption area. ...
The paper also contains the presentation of the original Signcryption scheme, based on ElGamal digital signature and discusses the practical applications of Signcryption in real life. ...
Conclusions and Future Work This paper presents a new Signcryption scheme which is based on Schnorr digital signature algorithm. ...
doi:10.4236/jsea.2012.52016
fatcat:lnmjdpret5e63atgffv6snkc7q
An Efficient Identity-based Signcryption from Lattice
2014
International Journal of Security and Its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, an efficient identity-based signcryption scheme from lattice was proposed. Our scheme based on Macciancio and Piekert's trapdoor generation method and delegate algorithm for lattice. ...
Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality. ...
on lattices to within small factors. ...
doi:10.14257/ijsia.2014.8.2.37
fatcat:6y7du2ge5bcqjnw5z2jzynrtoe
Signcryption Scheme that Utilizes Elliptic Curve for both Encryption and Signature Generation
2013
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper a Signcryption scheme is suggested which is based on Elliptic Curve Cryptography (ECC). ...
Signcryption scheme based on elliptic curves represents a remarkable saving in computational cost and in communication overhead. ...
Figure 9 compares, the time that is required to solve problem based on ECC and problem based on Integer factorization problem (IFP) or DLP. Here the time is measured in MIPS. ...
doi:10.5120/10112-4777
fatcat:pxaiwbzfajak3hqc54m4n6gq6m
A Strong Designated Verifiable DL Based Signcryption Scheme
2012
Journal of Information Processing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 ...
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). ...
CONCLUSION In this paper, we present a new designated verifiable signcrytion scheme based on DLP. Here the property strongly designated verifiability is satisfied. ...
doi:10.3745/jips.2012.8.4.567
fatcat:jas2ikagfjaptdeby2wfmebcre
Public Verifiable Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings
2016
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper presents public verifiable identity based multiproxy multi-signcryption scheme from pairings. ...
In this scheme a proxy signcrypter group could authorized as a proxy agent by the cooperation of all members in the original signcrypter group. ...
CONCLUSION In this paper, based on Liu Jun Bao and Xiao Guo-Zhen [15] we construct a public verifiable ID-based multi-proxy multisigncryption scheme from pairing. ...
doi:10.5120/ijca2016908887
fatcat:k6l7pmqumzhalloe6nriu4oije
Digital signcryption or how to achieve cost(signature & encryption) ≪ cost(signature) + cost(encryption)
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
) less in message expansion than does "signature followed by encryption" based on the discrete logarithm problem (factorization problem, respectively). ...
In particular, we discover a new cryptographie primitive termed as "signcryption" which simultaneously fulfills both the functions of digital signature and public key encryption in a logically single step ...
Therefore it remains a challenging open problem to design signcryption schemes based factorization or other computationally hard problems. ...
doi:10.1007/bfb0052234
fatcat:n5ewdyb2gbeppc4u5ukwjlnlxy
Conjugacy Systems Based on Nonabelian Factorization Problems and Their Applications in Cryptography
2014
Journal of Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose several conjugated problems related to the factorization problem over nonabelian groups and then present three constructions of cryptographic primitives based on these newly introduced ...
Recently, Baba et al. proposed an important analogy from the integer factorization problem to the factorization problem over nonabelian groups. ...
Signcryption with IND-CCA2 Security. Based on the encryption scheme 1 and the signature scheme 2 , let us proceed to present a signcryption scheme, denoted by 3 . ...
doi:10.1155/2014/630607
fatcat:7jqkwt5exnabdnwjumrwidzaue
Enhancing Email Security by Signcryption based on Elliptic Curve
2013
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, an elliptic curve based signcryption scheme is introduced that provides several security attributes such as confidentiality, authentication, integrity, non-repudiation, and forward secrecy ...
The currently used protocols such as PGP and S/MIME are based on public key cryptography that involves huge computational costs due to key generation, key exchange and encryption. ...
Proposed approach is as: EC based signcryption scheme is used since it is based on the difficulty of solving the ECDLP and the factorization in elliptic curves. ...
doi:10.5120/12451-9215
fatcat:yc23qa7b3faxpmzabb5z2mpz7i
Performance Comparison of Signcryption Schemes – A Step towards Designing Lightweight Cryptographic Mechanism
2017
International Journal of Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
Selection of Public Parameters 1. p and q -two large prime numbers, where q is a largeprime factor of 1 p −
g -a random integer inthe range 1, 1 p − with order q modulo p . 3 . ...
doi:10.21817/ijet/2017/v9i2/170902173
fatcat:jgcpm77nenfw3jkzb3hwtd4pbu
Noncommutative Lightweight Signcryption for Wireless Sensor Networks
2013
International Journal of Distributed Sensor Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we at first propose a braid-based signcryption scheme and then develop a key establishment protocol for wireless sensor networks. ...
From the complexity view, our proposal is 2 15 times faster than RSA-based ones. As far as we know, our proposal is the first signcryption scheme based on noncommutative algebraic structures. ...
Now, let us compare the braid-based signcryption schemes with the RSA-based ones. According to Cha et al. ...
doi:10.1155/2013/818917
fatcat:gzlglbgue5eahkk7336gtxljrm
How to construct efficient signcryption schemes on elliptic curves
1998
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
The purposes of this paper are to demonstrate how to specify signcryption schemes on elliptic curves over finite fields, and to examine the efficiency of such schemes. ...
Our analysis shows that when compared with signaturethen-encryption on elliptic curves, signcryption on the curves represents a 58% saving in computational cost and a 40% saving in communication overhead ...
Parameters for elliptic curve based signcryption schemes are summarized in Table 2 , and two signcryption schemes built on SECDSS1 and SECDSS2 are described in Table 3 . ...
doi:10.1016/s0020-0190(98)00167-7
fatcat:ogrwqo6pnvbw7lfkcnsfor52b4
An efficient Secure Electronic Mail System based on Elliptic Curve Certificateless Signcryption
2019
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, a CLC-EC-signcryption based secure E-mail system is proposed. To make the system more efficient, the encryption key is hidden in the transmitted ciphertext itself. ...
Therefore, the email security and efficiency has become a critical issue. ...
Signcryption When Alice has a message M to send in an E-mail to Bob, she does the following: 1. Choose a random integer x < p. 2. ...
doi:10.5120/ijca2019919619
fatcat:3cz3atsfpjdzna5su7ahi3mbam
« Previous
Showing results 1 — 15 out of 243 results