Generalized ID-based blind signatures from bilinear pairings
暂无分享,去创建一个
[1] Kamer Kaya,et al. Generalized ID-Based ElGamal Signatures with Message Recovery , 2007 .
[2] Antoine Joux,et al. A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.
[3] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[4] Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.
[5] Paulo S. L. M. Barreto,et al. Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps , 2005, ASIACRYPT.
[6] Patrick Horster,et al. Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications , 1994, ASIACRYPT.
[7] Kwangjo Kim,et al. Efficient ID-Based Blind Signature and Proxy Signature from Bilinear Pairings , 2003, ACISP.
[8] Xueli Wang,et al. One-Round ID-Based Blind Signature Scheme without ROS Assumption , 2007, IACR Cryptol. ePrint Arch..
[9] Jan Camenisch,et al. Blind Signatures Based on the Discrete Logarithm Problem , 1994, EUROCRYPT.
[10] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.
[11] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[12] Kefei Chen,et al. Efficient Identity-Based Signatures and Blind Signatures , 2005, CANS.
[13] Kwangjo Kim,et al. ID-Based Blind Signature and Ring Signature from Pairings , 2002, ASIACRYPT.
[14] S. Kalkan,et al. Generalized ID-based ElGamal signatures , 2007, 2007 22nd international symposium on computer and information sciences.