New ECDSA-Verifiable Multi-receiver Generalization Signcryption
暂无分享,去创建一个
[1] Zhenfu Cao,et al. Efficient and Provably Secure Multi-receiver Identity-Based Signcryption , 2006, ACISP.
[2] Silvio Micali,et al. Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements , 2000, EUROCRYPT.
[3] Yiliang Han. Generalization of signcryption for resources-constrained environments , 2007, Wirel. Commun. Mob. Comput..
[4] Fagen Li,et al. Efficient and provably secure multi-recipient signcryption from bilinear pairings , 2006, Wuhan University Journal of Natural Sciences.
[5] Li Fagen,et al. Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings , 2007 .
[6] Yuliang Zheng,et al. Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.
[7] Zhu Zhen. A multi-recipient signcryption scheme of strong security , 2008 .
[8] Han Yi. New ECDSA-Verifiable Generalized Signcryption , 2006 .
[9] Wenbo Mao,et al. Two Birds One Stone: Signcryption Using RSA , 2003, CT-RSA.
[10] Pil Joong Lee,et al. New Signcryption Schemes Based on KCDSA , 2001, ICISC.
[11] Xiaoyuan Yang,et al. ECGSC: Elliptic Curve based Generalized Signcryption Scheme , 2006, IACR Cryptol. ePrint Arch..
[12] Tal Rabin,et al. On the Security of Joint Signature and Encryption , 2002, EUROCRYPT.
[13] Kyung-Ah Shim,et al. New DSA-Verifiable Signcryption Schemes , 2002, ICISC.
[14] Daniel R. L. Brown. Generic Groups, Collision Resistance, and ECDSA , 2002, Des. Codes Cryptogr..
[15] Hideki Imai,et al. How to Construct Efficient Signcryption Schemes on Elliptic Curves , 1998, Inf. Process. Lett..
[16] Jacques Stern,et al. Flaws in Applying Proof Methodologies to Signature Schemes , 2002, CRYPTO.