Distributed Signcryption from Pairings
暂无分享,去创建一个
[1] Zhenfu Cao,et al. On the Security of a Group Signcryption Scheme from Distributed Signcryption Scheme , 2005, CANS.
[2] Robert H. Deng,et al. Public Key Cryptography – PKC 2004 , 2004, Lecture Notes in Computer Science.
[3] Ian F. Blake,et al. Advances in Elliptic Curve Cryptography: Frontmatter , 2005 .
[4] Steven D. Galbraith,et al. Implementing the Tate Pairing , 2002, ANTS.
[5] Mark Manulis,et al. Cryptology and Network Security , 2012, Lecture Notes in Computer Science.
[6] Antoine Joux,et al. Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups , 2001, IACR Cryptology ePrint Archive.
[7] Tal Rabin,et al. On the Security of Joint Signature and Encryption , 2002, EUROCRYPT.
[8] Moti Yung,et al. Advances in Cryptology — CRYPTO 2002 , 2002, Lecture Notes in Computer Science.
[9] Xiaotie Deng,et al. Analysis and Improvement of a Signcryption Scheme with Key Privacy , 2005, ISC.
[10] Aggelos Kiayias,et al. Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.
[11] Bimal Roy,et al. Progress in Cryptology —INDOCRYPT 2000 , 2002, Lecture Notes in Computer Science.
[12] Indivar Gupta,et al. Distributed signcryption scheme on hyperelliptic curve , 2007 .
[13] Aggelos Kiayias,et al. Traitor Tracing with Constant Transmission Rate , 2002, EUROCRYPT.
[14] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[15] Yuliang Zheng,et al. Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.
[16] Antoine Joux,et al. Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups , 2003, Journal of Cryptology.
[17] Chik How Tan. Analysis of improved signcryption scheme with key privacy , 2006, Inf. Process. Lett..
[18] Paulo S. L. M. Barreto,et al. Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.
[19] Dong Jin Kwak,et al. Efficient Distributed Signcryption Scheme as Group Signcryption , 2003, ACNS.
[20] Gerhard Frey,et al. The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems , 1999, IEEE Trans. Inf. Theory.
[21] Burton S. Kaliski. Advances in Cryptology - CRYPTO '97 , 1997 .
[22] Jeffrey Shallit,et al. Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.
[23] David Pointcheval,et al. The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes , 2001, Public Key Cryptography.
[24] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[25] Yi Mu,et al. Distributed Signcryption , 2000, INDOCRYPT.
[26] Dan Boneh,et al. The Decision Diffie-Hellman Problem , 1998, ANTS.
[27] Robert H. Deng,et al. A secure extension of the Kwak-Moon group signcryption scheme , 2006, Comput. Secur..
[28] Xiaotie Deng,et al. An Efficient Signcryption Scheme with Key Privacy , 2007, EuroPKI.
[29] Antoine Joux. A One Round Protocol for Tripartite Diffie-Hellman , 2000, ANTS.
[30] Arto Salomaa,et al. Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.
[31] Jean-Jacques Quisquater,et al. Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups , 2004, Public Key Cryptography.
[32] Victor S. Miller,et al. The Weil Pairing, and Its Efficient Calculation , 2004, Journal of Cryptology.