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
Certificateless signature scheme based on Rabin algorithm and discrete logarithm
2016
TELKOMNIKA (Telecommunication Computing Electronics and Control)
Preserved Fulltext
Certificateless signature can effectively immue the key escrow problem in the identity-based signature scheme. ...
In order to strengthen the security, in this paper, a certificateless signature whose security depends on two mathematical hard problems, discrete logarithm and factoring problems, is proposed. ...
It should be noted that the security of all the CLS schemes discussed above is based on only one security problem: discrete logarithm problem, or computing Diffie-Hellman problem, or factoring problem. ...
doi:10.12928/telkomnika.v14i1.2919
fatcat:lyfforinivek3i4l2cvhfhn44e
An UF-IBSS-CMA Protected Online/Offline Identity-based Short Signature Technique using PDL
2016
Procedia 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.
It is secure under unforgeability of identity-based short signature (IBSS) under chosen message attack (UF-IBSS-CMA) in random oracle. ...
In this article, we present an online/offline identity-based short signature scheme using partial discrete logarithm (PDL). ...
Kothari fellowship awarded by University Grants Commission, New Delhi, India to the first author and second author under DSA-I grant of UGC New Delhi, India. ...
doi:10.1016/j.procs.2016.07.253
fatcat:exuygsfjyngfhb6cwarcuhv4mi
Identity-based threshold group signature scheme based on multiple hard number theoretic problems
2020
International Journal of Electrical and Computer Engineering (IJECE)
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.
We introduce in this paper a new identity-based threshold signature (IBTHS) technique, which is based on a pair of intractable problems, residuosity and discrete logarithm. ...
This technique relies on two difficult problems and offers an improved level of security relative to an individual hard problem. ...
The technique relies on two difficult hard problems and offers an improved level of security relative to an individual difficult problem. ...
doi:10.11591/ijece.v10i4.pp3695-3701
fatcat:jmyhykzivbdspf5xxhu36ri6ae
An Identity-based Blind Signature Approach for E-voting System
2017
International Journal of Modern Education and 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.
Identity-based signature [18] . ...
Proposed scheme uses the combination of Bolyreva's blind signature scheme and Cha-Chaon's Identity-based signature. ...
2015EMR-I and the UPE-II grant received from JNU. ...
doi:10.5815/ijmecs.2017.10.06
fatcat:tslgj7h4o5eijdpytyy5jeajia
Efficient and secure multiple digital signature to prevent forgery based on ECC
2021
International Journal of Applied Science and 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 2021; you can also visit the original URL.
The file type is application/pdf.
Performance analysis is based on three factors-validity, efficiency and security. It is difficult to manage the algebraic logarithm problem in elliptic curve digital signature. ...
As receiver can verify signer's identity by comparing the received one with the actual identities. Authors proposed an efficient multiple signature based on discrete logarithm problem. ...
doi:10.6703/ijase.202109_18(5).010
fatcat:mbqksx3rergrxkcqaihqty5l2i
Efficient Identity-Based Signatures Secure in the Standard Model
[chapter]
2006
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.
The only known construction of identity-based signatures that can be proven secure in the standard model is based on the approach of attaching certificates to non-identity-based signatures. ...
Our scheme is obtained from a modification of Waters' recently proposed identity-based encryption scheme. It is computationally efficient and the signatures are short. ...
Acknowledgment We thank Jonathan Katz, Eike Kiltz and an anonymous reviewer for pointing out the folklore certification-based construction for identity-based signatures. ...
doi:10.1007/11780656_18
fatcat:5f2ihxbu6jaxtfc6ixc3imby3e
Non-interactive ID-based Proxy Re-signature Scheme for IoT Based on Mobile Edge 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 2021; you can also visit the original URL.
The file type is application/pdf.
And it is demonstrated to be provably secure under the classic security assumptions: integer factoring problem and the RSA assumption. ...
However, the centralized cloud computing-based storage architecture in IoT faces many challenges, such as data security, identity privacy, and high latency. ...
Assume that there exists an adversary Adv 2 breaking the limited proxy security in our proposed scheme, then we can create an algorithm B 2 to solve the large number factorization problem. ...
doi:10.1109/access.2019.2899828
fatcat:xnifcndnr5etni4dta4n7a3uni
Efficient ID-based Rabin Signature without Pairings
2017
International Journal of Multimedia and Ubiquitous 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 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, based on Rabin's cryptosystem, an efficient ID-based signature scheme without pairings is proposed. ...
ID-based signatures can greatly simplify the key management procedures of certificate-based public key infrastructures. ...
The security of our scheme is based on factoring problem. ...
doi:10.14257/ijmue.2017.12.3.08
fatcat:pc5fy2phvbctpg5meaazxuiw7e
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.
Recently, Baba et al. proposed an important analogy from the integer factorization problem to the factorization problem over nonabelian groups. ...
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 ...
Acknowledgments This work is partially supported by the National Natural Science Foundation of China (NSFC) (no. 61121061, 61370194) and the Fundamental Research Funds for the Central Universities (no. ...
doi:10.1155/2014/630607
fatcat:7jqkwt5exnabdnwjumrwidzaue
An Efficient Certificateless Blind Signature Scheme in the Random Oracle Model
[chapter]
2014
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.
The blind signature schemes are useful in some applications where the anonymity is a thorny issue. ...
The certificateless public key cryptography (CL-PKC) can eliminate the certificate management problem and solve the key escrow problem. ...
Up to now, even if there have been a lot of researches for blind signature, most of works have been based on a traditional public key infrastructure (PKI) or an identity-based public key cryptography ( ...
doi:10.1007/978-3-662-44917-2_53
fatcat:hwymxgr55vdjblhqmaeyuh3z2i
A provable secure key-escrow-free identity-based signature scheme without using secure channel at the phase of private key issuance
2019
Sadhana (Bangalore)
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.
In this paper, we propose an identity-based signature scheme that not only solves the key escrow problem but also eliminates the requirement of the secure channel. ...
Digital signature; identity-based cryptosystem; key escrow problem; computation Diffie-Hellman problem (CDHP); adaptively chosen message and identity attack. ...
All the identity-based signature schemes in [8] [9] [10] [11] suffer from an inherent problem, called key escrow problem as the PKG knows the user's private key which is computed by the PKG only and ...
doi:10.1007/s12046-019-1117-x
fatcat:52trryqsrzaq5kegm2uj6tu4lm
Design of Identity-Based Blind Signature Scheme Upon Chaotic Maps
2020
International Journal of Online and Biomedical Engineering (iJOE)
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.
Hence, we suggest a novel IDentity-based Blind Signature (ID-BS) based technique in this paper that relies on a pair of hard number theoretic problems, namely, the Chaotic Maps (CM) and FACtoring (FAC) ...
problems. ...
The ability of our scheme to offer superb reliability and security in addition to efficiency renders our presented scheme more suited for rational applications. ...
doi:10.3991/ijoe.v16i05.13809
fatcat:yjjzmvrryvfttk372mdeamunpm
Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model
[chapter]
2006
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.
The only known construction of identity-based signatures that can be proven secure in the standard model is based on the approach of attaching certificates to non-identity-based signatures. ...
Identity-based signatures An identity-based signatures scheme can be described as a collection of the following four algorithms: Setup This algorithm is run by the master entity on input a security parameter ...
Acknowledgment We thank Jonathan Katz and Eike Kiltz for pointing out the folklore certification-based construction for identity-based signatures. ...
doi:10.1007/11734727_33
fatcat:snmiurz2yfewtjxfgpno53fwsq
A Group Signature Scheme Based on the Integer Factorization and the Subgroup Discrete Logarithm Problems
[chapter]
2011
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 2017; you can also visit the original URL.
The file type is application/pdf.
A new group signature scheme is presented whose security is based on the Integer Factorization Problem (IFP) and on the Subgroup Discrete Logarithm Problem (SDLP). ...
Group signature schemes allow a user, belonging to a specific group of users, to sign a message in an anonymous way on behalf of the group. ...
The security of the scheme is based on two difficult problems from Number Theory: Integer factorization and subgroup discrete logarithms (and the DLP in the key generation). ...
doi:10.1007/978-3-642-21323-6_18
fatcat:57ihamt2nvc55m3eym2ck5a4me
A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model
2014
Mathematical Problems in 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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a new identity-based proxy blind signature scheme from lattices without random oracles. ...
To the best of our knowledge, our construction is the first short lattice-based identity-based proxy blind signature scheme in the standard model. ...
Acknowledgments This work was supported by Scientific Research Project Fund of Science and Technology Bureau of Zhengzhou (no. 20140713) and the project of science and technology office of Henan province ...
doi:10.1155/2014/307637
fatcat:lx7wvv2bxzgh3ilz6egqreytw4
« Previous
Showing results 1 — 15 out of 67,313 results