Anonymous fingerprinting scheme with straight-line extractors
Xin Liu · Journal of Computer Applications · 2011
Until now,fingerprinting scheme based on anonymous group signature construction has not yet been solved.To solve this problem,an anonymous fingerprinting scheme with straight-line extractors was proposed,which incorporated the technique of the Canard-Gouget-Hufschmitt zero-knowledge proof(CANARD S,GOUGET A,HUFSCHMITT E.A handy multi-coupon system.ACNS 2006: Proceedings of the 4th International Conference on Applied Cryptography and Network Security,LNCS 3989.Berlin: Springer-Verlag,2006: 66-81) of the OR statement,the Chida-Yamamoto batch zero-knowledge proof and verification(CHIDA K,YAMAMOTO G.Batch processing for proofs of partial knowledge and its applications.IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences,2008,E91-A(1): 150-159),and the straight-line extractable commitment scheme of Arita(ARITA S.A straight-line extractable non-malleable commitment scheme.IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences,2007,E90-A(7): 1384-1394).To note that,one of the salient features of the new scheme was supporting concurrent registration,so it was especially suitable to be deployed over the Internet.Moreover,the proposed scheme had straight-line extractors,i.e.,the security reduction algorithm did not depend on inefficient rewinding strategy and got tight security reduction.Formal security analysis shows that the proposed scheme achieves all the properties required by anonymous fingerprinting schemes.