The Experts below are selected from a list of 5964 Experts worldwide ranked by ideXlab platform

Li Jianhua - One of the best experts on this subject based on the ideXlab platform.

  • Improvement on Digital Signature Scheme with Message Recovery
    Computer Engineering, 2008
    Co-Authors: Li Jianhua
    Abstract:

    This paper investigates a Digital Signature Scheme with message recovery,which is claimed to resist forgery attacks without hash functions and message redundancies.Some attacks and an effective improvement on this Scheme are analyzed.A further improvement to shorten the signed Signature is presented.The improvement keeps the security properties and makes the Scheme more efficient.When p = 1024 and q = 160,the improved length of the signed Signature is only 44% of the original,which raises computation efficiency by 61% and communication efficiency by 56 %.

Sara K Miner - One of the best experts on this subject based on the ideXlab platform.

  • a forward secure Digital Signature Scheme
    International Cryptology Conference, 1999
    Co-Authors: Mihir Bellare, Sara K Miner
    Abstract:

    We describe a Digital Signature Scheme in which the public key is fixed but the secret signing key is updated at regular intervals so as to provide a forward security property: compromise of the current secret key does not enable an adversary to forge Signatures pertaining to the past. This can be useful to mitigate the damage caused by key exposure without requiring distribution of keys. Our construction uses ideas from the Fiat-Shamir and Ong-Schnorr identification and Signature Schemes, and is proven to be forward secure based on the hardness of factoring, in the random oracle model. The construction is also quite efficient.

  • a forward secure Digital Signature Scheme
    Lecture Notes in Computer Science, 1999
    Co-Authors: Mihir Bellare, Sara K Miner
    Abstract:

    We describe a Digital Signature Scheme in which the public key is fixed but the secret signing key is updated at regular intervals so as to provide a forward security property: compromise of the current sccret key does not enable an adversary to forge Signatures pertaining to the past. This can be useful to mitigate the damage caused by key exposure without requiring distribution of keys Our construction uses ideas from the Fiat-Shamir and Ong-Schnorr identification and Signature Schemes, and is proven to be forward secure based on the hardness of factoring, in the random oracle model The construction is also quite efficient.

Pan Yan-feng - One of the best experts on this subject based on the ideXlab platform.

  • Analysis of Digital Signature Scheme Based on NTRU
    Computer Engineering, 2010
    Co-Authors: Pan Yan-feng
    Abstract:

    The security of Digital Signature Scheme based on NTRU public key cryptosystem relies on the difficulty of searching nearest and shortest vector on NTRU metre.Aiming at this problem,this paper improves the Signature process,and gives the attack method for forge Signature under the same parameters.It can go on effect Signature for arbitrary message with great probability,and prove this Signature Scheme is not secure.

Vladimir Soukharev - One of the best experts on this subject based on the ideXlab platform.

  • a post quantum Digital Signature Scheme based on supersingular isogenies
    Financial Cryptography, 2017
    Co-Authors: Youngho Yoo, Reza Azarderakhsh, Amir Jalali, David Jao, Vladimir Soukharev
    Abstract:

    We present the first general-purpose Digital Signature Scheme based on supersingular elliptic curve isogenies secure against quantum adversaries in the quantum random oracle model with small key sizes. This Scheme is an application of Unruh’s construction of non-interactive zero-knowledge proofs to an interactive zero-knowledge proof proposed by De Feo, Jao, and Plut. We implement our proposed Scheme on an x86-64 PC platform as well as an ARM-powered device. We exploit the state-of-the-art techniques to speed up the computations for general C and assembly. Finally, we provide timing results for real world applications.

Xin Xiangjun - One of the best experts on this subject based on the ideXlab platform.

  • A New Digital Signature Scheme with Threshold Subliminal Channel
    2009 WASE International Conference on Information Engineering, 2009
    Co-Authors: Xin Xiangjun, Zhi Guizhen
    Abstract:

    To improve the security and efficiency of the Signature Scheme with threshold subliminal channel, by using the Lagrange interpolating polynomial and the Schnorr Signature Scheme under modular n, a new Digital Signature Scheme with (t, l) threshold subliminal channel is proposed. In the new Scheme, the subliminal channel can be used efficiently. On the other hand, under the hardness assumptions of factoring RSA modular and computing discrete logarithm, the proposed Scheme can be proved to be secure against resending subliminal message attack, forgery attack and conspiracy attack.

  • Digital Signature Scheme with a t l threshold subliminal channel based on rsa Signature Scheme
    Computational Intelligence and Security, 2008
    Co-Authors: Li Wei, Li Gang, Xin Xiangjun
    Abstract:

    The first Digital Signature Scheme with a (t, l) threshold subliminal channel was proposed by Lee et al. However, according to our analysis, it is found that Lee et al.?s Scheme is low efficient in practice. At the same time, Lee et al.?s Scheme is not secure against resending attack. Then, a randomized RSA Signature Scheme is proposed. The proposed randomized RSA Signature Scheme can be proved to be secure under adaptive chosen-message attacks in the random oracle model. Based on this Signature Scheme, by using the Lagrange interpolating polynomial and distributing the secret shadows of the RSA exponent among n subliminal receivers, a new Digital Signature Scheme with a (t, l) threshold subliminal channel is proposed, which overcomes all the shortcomings of the Scheme proposed by Lee et al. The new Scheme is secure and efficient in practice.

  • CIS (2) - Digital Signature Scheme with a (t, l) Threshold Subliminal Channel Based on RSA Signature Scheme
    2008 International Conference on Computational Intelligence and Security, 2008
    Co-Authors: Li Wei, Li Gang, Xin Xiangjun
    Abstract:

    The first Digital Signature Scheme with a (t, l) threshold subliminal channel was proposed by Lee et al. However, according to our analysis, it is found that Lee et al.?s Scheme is low efficient in practice. At the same time, Lee et al.?s Scheme is not secure against resending attack. Then, a randomized RSA Signature Scheme is proposed. The proposed randomized RSA Signature Scheme can be proved to be secure under adaptive chosen-message attacks in the random oracle model. Based on this Signature Scheme, by using the Lagrange interpolating polynomial and distributing the secret shadows of the RSA exponent among n subliminal receivers, a new Digital Signature Scheme with a (t, l) threshold subliminal channel is proposed, which overcomes all the shortcomings of the Scheme proposed by Lee et al. The new Scheme is secure and efficient in practice.