Skip to main content
SpringerLink
Log in

Double-trapdoor anonymous tags for traceable signatures

  • Special Issue Paper
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. It is possible to strengthen the notion of unlinkability by allowing \(\mathcal{A}\) to query oracles \(\mathsf{AT}.\mathsf{Tag} ({ mtpk},{ utsk}_\mathrm{b})\) and \(\mathsf{AT}.\mathsf{Tag} ({ mtpk},{ utsk}_{1-\mathrm{b}})\). For the proof to go through, we can simulate these oracles as \(\mathsf{AT}.\mathsf{Tag} ({ mtpk},{ utsk}_0)\) and \(\mathsf{AT}.\mathsf{Tag} ({ mtpk},{ utsk}_1)\), but each tag will be changed like what we did on the challenge tag in Game 5.

  2. Oracles of this type are for defining anonymity. Two target users \(i_0\) and \(i_1\) will be outputted by \(\mathcal{A}\), then the challenger will pick a random bit \(b\) and make both \(\mathcal{O}_\mathsf{a-sig }^{i_b}\) and \(\mathcal{O}_\mathsf{a-sig }^{i_{1-b}}\) available.

References

  1. Abdalla, M., Warinschi, B.: On the minimal assumptions of group signature schemes. In: ICICS ’04, LNCS 3269, pp. 1–13 (2004)

  2. 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)

  3. Abe, M., Haralambiev, K., Ohkubo, M.: Signing on Group Elements for Modular Protocol Designs. Cryptology ePrint Archive, Report 2010/133 (2010)

  4. 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)

  5. Blazy, O., Pointcheval, D.: Traceable signature with stepping capabilities. In: Cryptography and Security: From Theory to Applications, LNCS 6805, pp. 108–131 (2012)

  6. Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149–177 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Crypto ’04, LNCS 3152, pp. 41–55 (2004)

  8. Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: CCS ’04, pp. 168–177 (2004)

  9. Boyen, X.: The uber-assumption family: a unified complexity framework for bilinear groups. In: Pairing ’08, LNCS 5209, pp. 39–56 (2010)

  10. Chaum, D., van Heyst, E.: Group signatures. In: Eurocrypt ’91, LNCS 547, pp. 257–265 (1991)

  11. Chow, S.S.M.: Real traceable signatures. In: SAC ’09, LNCS 5867, pp. 92–107 (2009)

  12. 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)

  13. 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)

  14. Groth, J.: Fully anonymous group signatures without random oracles. In: Asiacrypt ’07, LNCS 4833, pp. 164–180 (2007)

  15. Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Eurocrypt ’08, LNCS 4965, pp. 415–432 (2008)

  16. Kiayias, A., Tsiounis, Y., Yung, M.: Traceable signatures. In: Eurocrypt ’04, LNCS 3027, pp. 571–589 (2004)

  17. Libert, B., Yung, M.: Efficient traceable signatures in the standard model. In: Pairing ’09, LNCS 5671, pp. 187–205 (2009)

  18. Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC ’90, pp. 427–437 (1990)

  19. 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)

  20. Santis, A.D., Persiano, G.: Zero-knowledge proofs of knowledge without interaction (extended abstract). pp. 427–436. IEEE (1992)

  21. Schuldt, J.C.N., Matsuura, K.: An efficient convertible undeniable signature scheme with delegatable verification. In: ISPEC ’10, LNCS 6047, pp. 276–293 (2010)

  22. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Eurocrypt ’97, LNCS 1233, pp. 256–266 (1997)

  23. 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)

Download references

Acknowledgments

The first and fourth authors thank Jae Hong Seo for his valuable comments.

Author information

Authors and Affiliations

  1. NTT Secure Platform Laboratories, 3-9-11 Midori-cho, Musashino-shi, Tokyo, 180-8585, Japan

    Masayuki Abe

  2. Department of Information Engineering, Chinese University of Hong Kong, Shatin, N.T., 180-8585, Hong Kong

    Sherman S. M. Chow

  3. IBM Research—Zurich, Saeumerstrasse 4, 8803 , Rueschlikon, Switzerland

    Kristiyan Haralambiev

  4. Security Architecture Laboratory, Network Security Research Institute, NICT, 4-2-1 Nukui-Kitamachi, Koganei, Tokyo, Japan

    Miyako Ohkubo

Authors
  1. Masayuki Abe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sherman S. M. Chow
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kristiyan Haralambiev
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Miyako Ohkubo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masayuki Abe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abe, M., Chow, S.S.M., Haralambiev, K. et al. Double-trapdoor anonymous tags for traceable signatures. Int. J. Inf. Secur. 12, 19–31 (2013). https://doi.org/10.1007/s10207-012-0184-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10207-012-0184-3

Keywords

Search

Navigation