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.
Filters
A threshold authenticated encryption scheme using hybrid problems
2014
Applied Mathematical Sciences
Preserved Fulltext
In this paper, we propose a threshold authenticated encryption scheme using both factoring and discrete logarithm problems. ...
We apply the concept of threshold cryptography in the verification and message recovery phase, where t out of n recipients are required to verify and recover the message. ...
We also thank to Mrs Alena Sanusi for her comments and constructive suggestions on the manuscript. ...
doi:10.12988/ams.2014.4142
fatcat:z4i4eeoldzhedl7e7gk4awxvqa
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
[chapter]
2003
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 2004; you can also visit the original URL.
The file type is application/pdf.
They further improved the result resisting an erasure-free adversary for signature schemes and encryption scheme [17], in which (1) an adversary corrupts servers at any point of the protocol depending ...
Fouque and Stern made the first attempt towards the one round distributed key generation [11]: A non-interactive proof of verifiable encryption discrete logarithm is attached to the shares encrypted by ...
However, to emphasize the efficiency of practical use, we construct a verifiable encryption of discrete logarithm over any homomorphic encryption schemes. ...
doi:10.1007/978-3-540-45203-4_8
fatcat:45er6ymncfhizo4ym7u2qwtebe
A Publicly Verifiable Authenticated Encryption Scheme Based on Factoring and Discrete Logarithms
2017
International Journal of Network Security
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.
In this article, we propose a publicly verifiable authenticated encryption scheme based on factoring and discrete logarithms. ...
We point out that even if either factoring or discrete logarithms is broken, this scheme still could keep the authentication, integration, and confidentiality of the message. ...
The proposed scheme is a publicly verifiable authenticated encryption scheme based on factoring and discrete logarithms. ...
dblp:journals/ijnsec/TsaiLTH17
fatcat:s35345ih6fdmnlplzbcncq7lby
Efficient and General PVSS Based on ElGamal Encryption
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.
Finally, an encryption-improving technique is proposed to achieve very high efficiency in the new PVSS scheme. ...
The other requires that the dealer must know the discrete logarithm of the secret to share and thus weakens the generality and it cannot be employed in many applications. ...
So knowledge of a discrete logarithm of the secret is compulsory to the dealer in the PVSS scheme in [10] . Therefore, it is not suitable for some applications. ...
doi:10.3745/jips.2012.8.2.375
fatcat:nolgrdpqgvcjbkksp62xqnbkxu
Multi-Authority Secret-Ballot Elections with Linear Work
[chapter]
1996
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 2003; you can also visit the original URL.
The file type is application/pdf.
Application of some novel techniques, in particular the construction of witness hiding/indistinguishable protocols from Cramer, Damgård and Schoenmakers, and the verifiable secret sharing scheme of Pedersen ...
, reduce the work required by the voter or an authority to a linear number of cryptographic operations in the population size (compared to quadratic in previous schemes). ...
Each family G for which it is reasonable to assume the intractability of the discrete logarithm problem is suitable for our purpose of constructing efficient and secure homomorphic encryption schemes with ...
doi:10.1007/3-540-68339-9_7
fatcat:bnzqh6ltkreubfgxutnrtj6r4q
Efficient verifiable encryption (and fair exchange) of digital signatures
1999
Proceedings of the 6th ACM conference on Computer and communications security - CCS '99
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.
This paper presents new simple schemes for verifiable encryption of digital signatures. ...
The performance of our schemes significantly surpasses that of prior art. ...
Acknowledgments We are grateful to Victor Shoup for illuminating discussions concerning the topic of this paper. ...
doi:10.1145/319709.319728
dblp:conf/ccs/Ateniese99
fatcat:zr4omvpqz5c4hgwiw3b5wup5xy
A Secure and Efficient Key Escrow Protocol for Mobile Communications
[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 2018; you can also visit the original URL.
The file type is application/pdf.
key for end-to-end encryption. ...
In this paper we present secure and efficient key escrow protocols that guarantees escrow secrecy, public verifiability, and robustness for mobile telecommunications systems. ...
First, each TTP randomly chooses a secret key Z q z and publishes his public- By the discrete logarithm of ( ) g y to the base g , we can now immediately obtain an efficient proof of knowledge for the ...
doi:10.1007/3-540-45545-0_52
fatcat:e4t5ghwltfgd7cor3xw2hdqf6q
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.
Main benefit of the proposed scheme is that it uses only elliptic curve for both encryption and signature generation. ...
The aim of this paper is to specify signcryption schemes on elliptic curves over finite fields, and to examine the efficiency of such schemes. ...
Because signcryption scheme provides both the functions of encryption and signature in a single logical step.5.3 Discrete Logarithm Signcryption versus sign-then encrypt : Computational complexity of different ...
doi:10.5120/10112-4777
fatcat:pxaiwbzfajak3hqc54m4n6gq6m
The Beta Cryptosystem
2015
Bulletin of Electrical Engineering and Informatics
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 next show that, the newly developed scheme is efficient with respect to encryption and decryption and the validity of this algorithm is proven by applying to message that are text and returning the ...
Therefore, this scheme is expected to gain a higher level of security. ...
The security of the new scheme is based on discrete logarithm problem. ...
doi:10.11591/eei.v4i2.442
fatcat:jgxamx4iabevbpzbpzlybbp4fe
Publicly Verifiable Secret Sharing
[chapter]
1996
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.
A secret sharing scheme allows to share a secret among several participants such that only certain groups of them can recover it. ...
We will call such schemes publicly verifiable secret sharing schemes, we discuss new applications t o w : m w cryptosystems and t o payment systems with revocablc anonymity, and we present two new realizations ...
Canienisch, and the anonymous referees for their useful comments. ...
doi:10.1007/3-540-68339-9_17
fatcat:tm3bfa6f7fe5hby37eo4vvkxvy
A New Cryptosystem Based on Factoring and Discrete Logarithm Problems
2011
Journal of Mathematics and Statistics
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 efficiency performance of our scheme only requires 3T exp +T mul + T hash time complexity for encryption and 2T exp + T mul time complexity for decryption and this magnitude of complexity is considered ...
Currently the existing cryptosystems were developed based on a single hard problem like factoring, discrete logarithm, residuosity, knapsack or elliptic curve discrete logarithm. ...
For efficiency performance, we evaluate the time complexity for both phases; encryption and decryption and also the communication cost for our scheme. ...
doi:10.3844/jmssp.2011.165.168
fatcat:q2ffvdnhvrfe7iw5euoi6cr4ra
An ID-Based Group Key Agreement Scheme for Controlling Access and Privacy in Cloud
2018
International Journal of Computer and Communication Engineering
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.
For achieving the access control and the privacy of data, the data owner can determine who can decrypt the encrypted data. ...
As the population of cloud service, more and more people concerns the privacy and security of cloud service. Therefore, an ID-based group key agreement scheme is proposed. ...
Discrete Logarithm Problem (DLP): For Y nX , and * q nZ . Given 1 , X Y G to compute n . It is discrete logarithm problem. ...
doi:10.17706/ijcce.2018.7.1.1-7
fatcat:t3pvklm5tjaylma4wwu3uitu2i
Authenticated Encryption Schemes: Current Status and Key Issues
2005
International Journal of Network Security
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.
The scheme is very suitable for the key agreement application, because a key is a small amount of a message. ...
In order to comprehend and interpret the authenticated encryption schemes overall, we discuss the evolution and the existed problems of authenticated encryption schemes. ...
All of above basic authenticated encryption schemes are based on discrete logarithm. ...
dblp:journals/ijnsec/HwangL05a
fatcat:xz6wihofxvcwbbnwl5rbhhdbqy
A Review of Elliptic Curve based Signcryption Schemes
2014
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.
Also, the elliptic curve based signcryption schemes are suitable for resource constrained applications. ...
Signcryption is a new cryptographic approach which provides authentication and encryption simultaneously in a single logical step. The aim is to reduce the cost of signature-thenencryption approach. ...
Signcryption schemes can be based on Discrete Logarithmic Problem (DLP) or Elliptic Curve Discrete Logarithmic Problem (ECDLP). ...
doi:10.5120/17821-8769
fatcat:eentzg7llzaixjpqykgl7pvgjy
An Efficient Certificate-based Verifiable Encrypted Signature Scheme Without Pairings
2015
Open Cybernetics and Systemics Journal
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.
A CB-PKS scheme is a compromise between IB-PKS and PKS. It consists of a certifier and users, each user generates his own An Efficient Certificate-based Verifiable Encrypted Signature Scheme The Open ...
We incorporate the verifiable encrypted signature into the certificate-based signature to propose an efficient certificate-based verifiable encrypted signature scheme in the paper, which does not require ...
ACKNOWLEDGEMENTS The authors thank the anonymous referees and reviewers for their very valuable comments on this paper. This work is supported by Natural Science Foundation of China (No. ...
doi:10.2174/1874110x01408010239
fatcat:3evvfxeuh5ekbeyfwdflfbys3e
« Previous
Showing results 1 — 15 out of 7,850 results