How to Construct State Registries–Matching Undeniability with Public Security
We propose a cryptographic architecture for state registries, which are reference databases holding data such as personal birth data, driver’s licenses, vehicles admitted for road traffic. We focus on providing a practical construction that fulfills fundamental requirements concerning strong undeniability of data from the database and resilience to manipulations. On the other hand, the construction has to enable creating fake records in the database by the authorities for the purpose of law enforcement (e.g. creating identities for covered agents trying to infiltrate organized crime).
Keywordsregistry secure system architecture undeniability group signatures hash function
Unable to display preview. Download preview PDF.
- 1.Chen, X., Zhang, F., Tian, H., Wei, B., Kim, K.: Key-exposure free chameleon hashing and signatures based on discrete logarithm systems. Cryptology ePrint Archive, Report 2009/035 (2009)Google Scholar
- 2.Contini, S., Lenstra, A.K., Steinfeld, R.: VSH, an efficient and provable collision resistant hash function (2005)Google Scholar
- 5.Frankel, Y., MacKenzie, P.D., Yung, M.: Robust efficient distributed RSA-key generation. In: PODC, p. 320 (1998)Google Scholar
- 6.Young, A., Yung, M.: Kleptography: Using cryptography against cryptography. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 62–74. Springer, Heidelberg (1997)Google Scholar
- 7.Chaum, D., Antwerpen, H.V.: Undeniable signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 212–216. Springer, Heidelberg (1990)Google Scholar