Double-trapdoor anonymous tags for traceable signatures

Springer Science and Business Media LLC - Tập 12 - Trang 19-31 - 2013
Masayuki Abe1, Sherman S. M. Chow2, Kristiyan Haralambiev3, Miyako Ohkubo4
1NTT Secure Platform Laboratories, Musashino-shi, Japan
2Department of Information Engineering, Chinese University of Hong Kong, Shatin, Hong Kong
3IBM Research—Zurich, Rueschlikon, Switzerland
4Security Architecture Laboratory, Network Security Research Institute, NICT, Koganei, Tokyo, Japan

Tóm tắt

This paper introduces a novel tool, public-key anonymous tag system, which is useful in building controlled privacy-protecting protocols. The double-trapdoor structure of the system not only allows the authority to create a token which can trace someone’s tags without violating anonymity of the tag issuer, but also allows the issuer to claim or deny the authorship of a tag in the stateless manner. An efficient instantiation based on simple assumptions in the standard model is presented. We then use it for a modular construction of traceable signatures. Our scheme supports a signature authorship claiming (and denial) that binds a claim to the public-key of the signer unlike that in known schemes. It is also the first scheme in the literature which features concurrent joining of users, stronger anonymity, and so on without random oracles.

Tài liệu tham khảo

Abdalla, M., Warinschi, B.: On the minimal assumptions of group signature schemes. In: ICICS ’04, LNCS 3269, pp. 1–13 (2004) Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. In: CRYPTO ’10, LNCS 6223, pp. 209–237 (2010) Abe, M., Haralambiev, K., Ohkubo, M.: Signing on Group Elements for Modular Protocol Designs. Cryptology ePrint Archive, Report 2010/133 (2010) Bichsel, P., Camenisch, J., Neven, G., Smart, N.P., Warinschi, B.: Get shorty via group signatures without encryption. In: SCN ’10, LNCS 6280, pp. 381–398 (2010) Blazy, O., Pointcheval, D.: Traceable signature with stepping capabilities. In: Cryptography and Security: From Theory to Applications, LNCS 6805, pp. 108–131 (2012) Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149–177 (2008) Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Crypto ’04, LNCS 3152, pp. 41–55 (2004) Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: CCS ’04, pp. 168–177 (2004) Boyen, X.: The uber-assumption family: a unified complexity framework for bilinear groups. In: Pairing ’08, LNCS 5209, pp. 39–56 (2010) Chaum, D., van Heyst, E.: Group signatures. In: Eurocrypt ’91, LNCS 547, pp. 257–265 (1991) Chow, S.S.M.: Real traceable signatures. In: SAC ’09, LNCS 5867, pp. 92–107 (2009) Chow, S.S.M., Chu, C.K., Huang, X., Zhou, J., Deng, R.H.: Dynamic secure cloud storage with provenance. In: Cryptography and Security: from Theory to Applications, LNCS 6805, pp. 442–464 (2012) Chow, S.S.M., He, Y.J., Hui, L.C.K., Yiu, S.M.: SPICE—simple privacy-preserving identity-management for cloud environment. In: ACNS ’12, LNCS 7341, pp. 526–543 (2012) Groth, J.: Fully anonymous group signatures without random oracles. In: Asiacrypt ’07, LNCS 4833, pp. 164–180 (2007) Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Eurocrypt ’08, LNCS 4965, pp. 415–432 (2008) Kiayias, A., Tsiounis, Y., Yung, M.: Traceable signatures. In: Eurocrypt ’04, LNCS 3027, pp. 571–589 (2004) Libert, B., Yung, M.: Efficient traceable signatures in the standard model. In: Pairing ’09, LNCS 5671, pp. 187–205 (2009) Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC ’90, pp. 427–437 (1990) Sakai, Y., Schuldt, J.C.N., Emura, K., Hanaoka, G., Ohta, K.: On the security of dynamic group signatures: preventing signature-hijacking. In: PKC ’12, LNCS 7293, pp. 715–732 (2012) Santis, A.D., Persiano, G.: Zero-knowledge proofs of knowledge without interaction (extended abstract). pp. 427–436. IEEE (1992) Schuldt, J.C.N., Matsuura, K.: An efficient convertible undeniable signature scheme with delegatable verification. In: ISPEC ’10, LNCS 6047, pp. 276–293 (2010) Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Eurocrypt ’97, LNCS 1233, pp. 256–266 (1997) Yu, K.Y., Yuen, T.H., Chow, S.S.M., Yiu, S.M., Hui, L.C.K.: PE(AR)\(^2\): privacy-enhanced anonymous authentication with reputation and revocation. In: ESORICS ’12, LNCS 7459, pp. 679–696 (2012)