IMPROVEMENT OF A PROACTIVE THRESHOLD SIGNCRYPTION SCHEME

F. Li,∗ C. Xu,∗ and S. Zhou∗

References

  1. [1] Y. Zheng, Digital signcryption or how to achieve cost (signature& encryption) cost (signature) + cost (encryption), Proc.Advances in Cryptology – CRYPTO’97, Lecture Notes inComputer Science 1294 (Berlin: Springer-Verlag, 1997), 165–179.
  2. [2] J. Baek, R. Steinfeld, & Y. Zheng, Formal proofs for thesecurity of signcryption, Proc. Public Key Cryptography –PKC 2002, Lecture Notes in Computer Science 2274 (Berlin:Springer-Verlag, 2002), 80–98.
  3. [3] B. Libert & J.J. Quisquater, Efficient signcryption with keyprivacy from gap Diffie-Hellman groups, Proc. Public KeyCryptography – PKC 2004, Lecture Notes in Computer Science2947 (Berlin: Springer-Verlag, 2004), 187–200.
  4. [4] C.H. Tan, On the security of signcryption scheme with keyprivacy, IEICE Transactions on Fundamentals, E88-A(4),2005, 1093–1095.
  5. [5] G. Yang, D.S. Wong, & X. Deng, Analysis and improvementof a signcryption scheme with key privacy, Proc. InformationSecurity – ISC 2005, Lecture Notes in Computer Science 3650(Berlin: Springer-Verlag, 2005), 218–232.
  6. [6] C. Ma, K. Chen, D. Zheng, & S. Liu, Efficient and proactivethreshold signcryption, Proc. Information Security – ISC 2005,Lecture Notes in Computer Science 3650 (Berlin: Springer-Verlag, 2005), 233–243.
  7. [7] Y. Desmedt & Y. Frankel, Threshold cryptosystems, Proc.Advances in Cryptology – CRYPTO’89, Lecture Notes inComputer Science 435 (Berlin: Springer-Verlag, 1989), 307–315.

Important Links:

Go Back