Learn More
C. A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed an efficient multi-secret sharing scheme based on a two-variable one-way function in 2004. But the scheme doesn't have the property of verification. A practical verifiable multi-secret sharing scheme, which is based on the YCH scheme and the(More)
In a (t, n) threshold proxy signature scheme, an original signer can delegate the signature authority to a proxy group of n member such that t or more than t proxy signers can cooperatively sign messages on behalf of the original signer, but t − 1 or fewer proxy signers cannot generate a valid proxy signature. In this paper, we review the security of C. L.(More)
Identity-based authenticated key agreement protocol becomes more and more important, but some schemes have security flaws, and others have more computation cost. This paper describes the weakness of Q. Yuan's protocol, and proposes an improved protocol from this protocol and Smart's scheme, which satisfy all the security properties. And the analysis of the(More)
In this paper, we propose a practical dynamic multi-secret sharing scheme based on the intractability of the discrete logarithm and one way hash functions, the exclusive OR operation. Security analysis shows that our scheme could correctly reconstruct the shared secret, and our scheme is as secure as Lin-Yeh's scheme. In addition, in our schemes, all(More)
  • 1