[1] PFITZMANN B, SADEGHI A R. Coin-based anonymous finger-printing [C]// EUROCRYPT 1999: Proceedings of International Conference on the Theory and Application of Cryptographic Techniques, LNCS 1592. Berlin: Springer-Verlag, 1999: 150-164.[2] CAMENISCH J. Efficient anonymous fingerprinting with group signatures [C]// ASIACRYPT 2000: Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security, LNCS 1976. Berlin: Springer-Verlag, 2000: 415-428.[3] WU Y. Security flaws in Kuribayashi-Tanaka fingerprinting protocol [C]// ICC 2007: Proceedings of the IEEE International Conference on Communications 2007. Piscataway, NJ: IEEE, 2007: 1317-1322.[4] 谭示崇,王育民.一种基于群签名的匿名数字指纹方案[J].计算机科学,2007,134(13):56-57.[5] HARAMURA K, YOSHIDA M, FUJIWARA T. Anonymous fingerprinting for predelivery of contents[C]// ICISC 2008: Proceedings of the 11th International Conference on Information Security and Cryptology, LNCS 5461. Berlin: Springer-Verlag, 2009: 134-151.[6] 柳欣,徐秋亮,秦然.基于群签名构造实用数字指纹方案[J].计算机工程与应用,2009,45(24):110-113.[7] KURIBAYASHI M. On the implementation of spread spectrum fingerprinting in asymmetric cryptographic protocol [J]. EURASIP Journal on Information Security, 2010, 2010(1): 1-11.[8] MAKITA T, MANABE Y, OKAMOTO T. Short group signatures with efficient flexible join [C]// SCIS 2006: Proceedings of the 2006 Symposium on Cryptography and Information Security. Tokyo: IEICE, 2006: 17-20.[9] AKAGI N, MANABE Y, OKAMOTO T. An efficient anonymous credential system [C]// Financial Cryptography 2008: Proceedings of the 12th International Conference on Financial Cryptography and Data Security, LNCS 5143. Berlin: Springer-Verlag, 2008: 272-286.[10] ZHOU SUJING, LIN DONGDAI. Shorter verifier-local revocation group signatures from bilinear maps [C]// CANS 2006: Proceedings of the 5th International Conference on Cryptology and Network Security, LNCS 4301. Berlin: Springer-Verlag, 2006: 126-143.[11] CANARD S, GOUGET A, HUFSCHMITT E. A handy multi-coupon system [C]// ACNS 2006: Proceedings of the 4th International Conference on Applied Cryptography and Network Security, LNCS 3989. Berlin: Springer-Verlag, 2006: 66-81.[12] CHIDA K, YAMAMOTO G. Batch processing for proofs of partial knowledge and its applications [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008, E91-A(1): 150-159.[13] ARITA S. A straight-line extractable non-malleable commitment scheme [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007, E90-A(7): 1384-1394.[14] OKAMOTO T. Efficient blind and partially blind signatures without random oracles [C]// TCC 2006: Proceedings of the Third Theory of Cryptography Conference, LNCS 3876. Berlin: Springer-Verlag, 2006: 80-99.[15] CRAMER R, SHOUP V. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack [C]// CRYPTO 1998: Proceedings of the 18th Annual International Cryptology Conference, LNCS 1462, Berlin: Springer-Verlag, 1998: 13-25.[16] KIAYIAS A, YUNG M. Group signatures with efficient concurrent join [C]// EUROCRYPT 2005: Proceedings of the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 3494. Berlin: Springer-Verlag, 2005: 198-214.[17] BICHSEL P, CAMENISCH J, NEVEN G, et al. Get shorty via group signatures without encryption [C]// SCN 2010: Proceedings of the 7th Conference on Security and Cryptography for Networks, LNCS 6280. Berlin: Springer-Verlag, 2010: 381-398. |