Cryptanalysis and improvement of signcryption schemes
暂无分享,去创建一个
[1] David Chaum,et al. Zero-Knowledge Undeniable Signatures , 1991, EUROCRYPT.
[2] Silvio Micali,et al. How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design , 1986, CRYPTO.
[3] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[4] Patrick Horster,et al. Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications , 1994, ASIACRYPT.
[5] Yuliang Zheng,et al. Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.
[6] Chin-Chen Chang,et al. Authenticated encryption scheme without using a one way function , 1995 .
[7] Rainer A. Rueppel,et al. Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem , 1996, Des. Codes Cryptogr..
[8] Patrick Horster,et al. Authenticated encryption schemes with low communication costs , 1994 .
[9] Rainer A. Rueppel,et al. Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem , 1994, EUROCRYPT.
[10] Markus Stadler,et al. Publicly Verifiable Secret Sharing , 1996, EUROCRYPT.
[11] Yuliang Zheng,et al. Signcryption and Its Applications in Efficient Public Key Solutions , 1997, ISW.