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.
Filters
Efficient Online/Offline Signcryption Scheme
2010
Intelligent Automation and Soft Computing
Preserved Fulltext
In this paper, we propose a new signcryption scheme and its online/offline version from pairings. ...
A comparison is made with existing schemes from the viewpoint of computational cost and the size of ciphertexts. ...
In the settings where both privacy and authentication are needed, it is a straightforward idea to compose these two schemes to construct a new authenticated encryption scheme [5, 6, 12] . ...
doi:10.1080/10798587.2010.10643092
fatcat:sfncgtfz4vc3fmocjps6fjmsei
On the Joint Security of Signature and Encryption Schemes under Randomness Reuse: Efficiency and Security Amplification
[chapter]
2012
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 2016; you can also visit the original URL.
The file type is application/pdf.
We obtain a very efficient signcryption scheme that is secure against insider attackers without random oracles. ...
We extend the work of Bellare, Boldyreva and Staddon on the systematic analysis of randomness reuse to construct multi-recipient encryption schemes to the case where randomness is reused across different ...
The authors would like to thank Nigel Smart and the anonymous ACNS'12 reviewers for helping to improve the quality of the paper. ...
doi:10.1007/978-3-642-31284-7_13
fatcat:6w5ppsu2rrhrlakjrpv3m33tiq
Hybrid Signcryption Schemes with Insider Security
[chapter]
2005
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 2006; you can also visit the original URL.
The file type is application/pdf.
That paper also demonstrated that the basic hybrid construction formalised by Cramer and Shoup [5, 9] is incapable of producing a signcryption scheme with insider security. ...
The question of constructing a hybrid signcryption scheme with outside security was considered by Dent [7] . ...
The author gratefully acknowledges the financial support of the EPSRC. ...
doi:10.1007/11506157_22
fatcat:x5tqkyoasrerdeqxjbtwocnrye
Hybrid Signcryption Schemes with Outsider Security
[chapter]
2005
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 2006; you can also visit the original URL.
The file type is application/pdf.
This paper expands the notion of a KEM-DEM hybrid encryption scheme to the signcryption setting by introducing the notion of a signcryption KEM, a signcryption DEM and a hybrid signcryption scheme. ...
We also present ECISS-KEM -a simple, efficient and provably secure example of a signcryption KEM. Lastly, we briefly discuss the problems associated with using KEMs in key establishment protocols. ...
The author would also like to thank several sets of anonymous reviewers for their comments. The author gratefully acknowledges the financial support of the EPSRC. ...
doi:10.1007/11556992_15
fatcat:2eyunkd6nvaklk3w2xggne4b7e
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.
In the course of achieving our goal, we also show efficient protocols for user identification, and fast and compact digital signature schemes. ...
This contributes to the research of extending computational underpinnings of signcryption schemes to problems related to integer factorization. ...
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
Implementation of Schnorr Signcryption Algorithm on DSP
2015
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.
We evaluate the performance by computing the consumed time by encryption/decryption process, while implementing the Schnorr Signcryption scheme on a DSP. ...
Signcryption algorithm, which is based on public key cryptography, provides both confidentiality and authenticity in one step. ...
A recent direction is to merge the concepts of identity-based cryptography [16, 17] and Signcryption to design an efficient identity-based signcryption (IBSC) schemes. ...
doi:10.14257/ijsia.2015.9.11.21
fatcat:ulfw5wob35gcjbreckrvcreaiu
A novel threshold key management scheme based on bilinear pairing without a trusted party in Mobile Ad Hoc Network
2012
2012 IEEE 14th International Conference on Communication 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.
Additionally, we design a new bilinear pairing based signcryption scheme, which is efficient in terms of both the communication overhead and the computational requirement. ...
Security analysis results show that our scheme is more secure, verifiable and efficient compared with the previous schemes on Mobile Ad Hoc Network. ...
Additionally, we proposed a new bilinear pairing based signcryption scheme, which is efficient in terms of both the communication overhead and the computational requirement. ...
doi:10.1109/icct.2012.6511191
fatcat:iuhl3pgw2nejxo34vmbjlzrixu
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.
Secure and authenticated message delivery/storage is one of the major aims of computer and communication security research. ...
For typ-icM security parameters for high level security applications (size of public moduli = 1536 bits), signcryption costs 50% (31~), respectively) less in computation time and 85% (91%, respectively ...
Then we show how to use a common property of these schemes to construct signcryption schemes. ...
doi:10.1007/bfb0052234
fatcat:n5ewdyb2gbeppc4u5ukwjlnlxy
Securing Wireless Body Area Network with Efficient Secure Channel Free and Anonymous Certificateless Signcryption
2021
Wireless Communications and Mobile Computing
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 2021; you can also visit the original URL.
The file type is application/pdf.
A highly efficient and secure cryptographic scheme that can fulfill the needs of resource-constrained WBAN sensors and devices is considered necessary. ...
The computation cost of the proposed scheme is 3.36 ms, which is much better than its counterpart schemes. ...
Conflicts of Interest The authors declare no conflicts of interest with respect to the research, authorship, and/or publication of this article. ...
doi:10.1155/2021/5986469
fatcat:2u666g4jfngjvo6xpjgbepgimm
Anonymous Signcryption against Linear Related-Key Attacks
[chapter]
2013
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.
of the signcryption and the receiver of the message, and yet be decipherable by the targeted receiver. ...
of the signcryption and the receiver of the message, and yet be decipherable by the targeted receiver. ...
An signcryption scheme is composed of the following four algorithms [24] : Setup, Keygen, Signcrypt, Designcrypt. ...
doi:10.1007/978-3-642-41227-1_10
fatcat:sszc3qzodbbphip4edkgporcwq
An Efficient Revocable Attribute-Based Signcryption Scheme with Outsourced Unsigncryption in Cloud Computing
2019
IEEE Access
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 2020; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we compare the performance of our scheme with others in terms of the ciphertext, key size, computation cost and functionality. ...
In this paper, we present an efficient revocable signcryption (CP-ABSC) with outsourced unsigncryption scheme based on ciphertext-policy attribute based encryption (CP-ABE) to secure the data sharing in ...
OUR CONSTRUCTION We give the detailed construction of our revocable attributebased signcryption scheme with outsourced designcryption in this section. ...
doi:10.1109/access.2019.2963233
fatcat:3rieip7gsbf3tjirs7ygae6ncu
Signcryption and its applications in efficient public key solutions
[chapter]
1998
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 paper summarizes currently known construction methods for signcryption, carries out a comprehensive comparison between signcryption and "signature followed by encryption", and suggests a number of ...
applications of signcryption in the search of efficient security solutions based on public key cryptography. ...
The very idea of combining signature with encryption can be partially traced many years back when I was still Professor Imai's PhD student and learnt the beauty of Imai-Hirakawa scheme, a revolutionary ...
doi:10.1007/bfb0030430
fatcat:xxst3lvvdvdblmatr6nt2wdh5m
On the Security of Joint Signature and Encryption
[chapter]
2002
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 2018; you can also visit the original URL.
The file type is application/pdf.
We then examine generic sequential composition methods of building signcryption from a signature and encryption scheme. ...
Unlike the generic sequential composition methods, CtE&S applies the expensive signature and encryption operations in parallel, which could imply a gain in efficiency over the StE and EtS schemes. ...
Third, there are other interesting constructions for signcryption which do not follow the paradigm of sequentially composing signatures and encryption. ...
doi:10.1007/3-540-46035-7_6
fatcat:qiv7dnmeqjbjteuhvt6qbbqtje
Identity-Based Proxy Signcryption Protocol with Universal Composability
2018
Security and Communication 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 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we construct an identity-based proxy signcryption protocol (IBPSP) based on the universally composable (UC) framework. ...
At the same time, an ideal functionality of the identity-based proxy signcryption protocol is defined in the UC security framework, and we also prove the equivalence between the universally composable ...
Conflicts of Interest The authors declare that they have no conflicts of interest.
Security and Communication Networks
Acknowledgments ...
doi:10.1155/2018/9531784
fatcat:xuxd23ct2rcjdlykclx3vfs3gm
Cryptanalysis of a Certificateless Ring Signcryption Scheme
2015
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 2018; you can also visit the original URL.
The file type is application/pdf.
Recently, Qi et al. proposed a novel certificateless ring signcryption scheme with bilinear pairings, and claimed the scheme is provably-secure in the random oracle model. ...
s scheme is not secure against both a Type I adversary and a Type II adversary. ...
Acknowledgements The work was supported by the National Natural Science Foundation of China (61402015) and Scientific Research Program of Baoji University of Arts and Sciences (ZK12042). ...
doi:10.14257/ijsia.2015.9.7.30
fatcat:34zwdrmp2rcqfmz7hdmyoi745m
« Previous
Showing results 1 — 15 out of 203 results