Abstract
We present a formal model for domain pseudonymous signatures – in particular providing a simple and strong concept and comprehensive formalization of unlinkability, which is the key property of domain pseudonymous signatures. Following the approach deployed for German personal identity cards, we consider domains that have to be registered and require a particular form of domain specifications. We introduce and formalize the deanonymization procedures that have to be implemented as one of the crucial functionalities in many application areas of domain signatures. Finally, we present two constructions that correspond to this model.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The most notable issues with the security model from [1] is the fact that according to their unlinkability definition every adversary may win the game, thus there cannot exists a scheme which would securely implement such model.
- 2.
- 3.
If we go into details and wish to model the situation where some of the parties of the domain creator are controlled by the adversary, we would have to adjust the oracles accordingly.
References
Bender, J., Dagdelen, Ö., Fischlin, M., Kügler, D.: Domain-specific pseudonymous signatures for the German identity card. In: Bishop, M., Nascimento, A.C.A. (eds.) ISC 2016. LNCS, vol. 9866, pp. 104–119. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33383-5_7
Bringer, J., Chabanne, H., Patey, A.: Collusion-resistant domain-specific pseudonymous signatures. In: Au, M.H., Carminati, B., Kuo, C.-C.J. (eds.) NSS 2014. LNCS, vol. 8792, pp. 649–655. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38631-2_52
Bringer, J., Chabanne, H., Lescuyer, R., Patey, A.: Efficient and strongly secure dynamic domain-specific pseudonymous signatures for ID documents. In: Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D., Brenner, M., Rohloff, K. (eds.) FC 2016. LNCS, vol. 9604, pp. 255–272. Springer, Heidelberg (2014). doi:10.1007/978-3-662-45472-5_16
BSI: Advanced Security Mechanisms for Machine Readable Travel Documents and eIDAS Token 2.20. Technical Guideline TR-03110-2 (2015)
Camenisch, J., Drijvers, M., Lehmann, A.: Universally composable direct anonymous attestation. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9614, pp. 234–264. Springer, Heidelberg (2016). doi:10.1007/978-3-662-49387-8_10
Camenisch, J., Krenn, S., Lehmann, A., Mikkelsen, G.L., Neven, G., Pedersen, M.: Formal treatment of privacy-enhancing credential systems. Cryptology ePrint Archive, Report 2014/708 (2014). http://eprint.iacr.org/
Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410–424. Springer, Heidelberg (1997). doi:10.1007/BFb0052252
Christian Paquin, G.Z.: U-Prove cryptographic specification v1.1 (revision 3), December 2013. https://www.microsoft.com/en-us/research/publication/u-prove-cryptographic-specification-v1-1-revision-3/
Hanzlik, L., Kluczniak, K., Kutyłowski, M.: Insecurity of anonymous login with German personal identity cards. In: SocialSec 2015, pp. 39–43. IEEE (2015)
Herfert, M., Lange, B., Selzer, A., Waldmann, U.: A privacy-friendly method to reward participants of online-surveys. In: Katsikas, S.K., Sideridis, A.B. (eds.) e-Democracy 2015. CCIS, vol. 570, pp. 33–47. Springer, Heidelberg (2015). doi:10.1007/978-3-319-27164-4_3
Kluczniak, K.: Domain-specific pseudonymous signatures revisited. Cryptology ePrint Archive, Report 2016/070 (2016). http://eprint.iacr.org/2016/070
Kluczniak, K., Hanzlik, L., Kubiak, P., Kutyłowski, M.: Anonymous evaluation system. In: Au, M.H., Carminati, B., Kuo, C.-C.J. (eds.) NSS 2014. LNCS, vol. 8792, pp. 283–299. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25645-0_19
Kutyłowski, M., Shao, J.: Signing with multiple ID’s and a single key. In: Consumer Communications and Networking Conference (CCNC), pp. 519–520. IEEE (2011)
Kutyłowski, M., Hanzlik, L., Kluczniak, K.: Pseudonymous signature on eIDAS token – implementation based privacy threats. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 467–477. Springer, Heidelberg (2016). doi:10.1007/978-3-319-40367-0_31
Lysyanskaya, A., Rivest, R.L., Sahai, A., Wolf, S.: Pseudonym systems. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol. 7707, pp. 184–199. Springer, Heidelberg (2000). doi:10.1007/3-540-46513-8_14
Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149–177 (2008). Springer
Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56–72. Springer, Heidelberg (2004). doi:10.1007/978-3-540-28628-8_4
Acknowledgments
This research was supported by National Research Center grant OPUS no 2014/15/B/ST6 /02837.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Kluczniak, K., Hanzlik, L., Kutyłowski, M. (2016). A Formal Concept of Domain Pseudonymous Signatures. In: Bao, F., Chen, L., Deng, R., Wang, G. (eds) Information Security Practice and Experience. ISPEC 2016. Lecture Notes in Computer Science(), vol 10060. Springer, Cham. https://doi.org/10.1007/978-3-319-49151-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-49151-6_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49150-9
Online ISBN: 978-3-319-49151-6
eBook Packages: Computer ScienceComputer Science (R0)