How to Construct State Registries–Matching Undeniability with Public Security

  • Przemysław Kubiak
  • Mirosław Kutyłowski
  • Jun Shao
Conference paper

DOI: 10.1007/978-3-642-12145-6_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5990)
Cite this paper as:
Kubiak P., Kutyłowski M., Shao J. (2010) How to Construct State Registries–Matching Undeniability with Public Security. In: Nguyen N.T., Le M.T., Świątek J. (eds) Intelligent Information and Database Systems. ACIIDS 2010. Lecture Notes in Computer Science, vol 5990. Springer, Berlin, Heidelberg

Abstract

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

Keywords

registry secure system architecture undeniability group signatures hash function 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Przemysław Kubiak
    • 1
  • Mirosław Kutyłowski
    • 1
  • Jun Shao
    • 2
  1. 1.Institute of Mathematics and Computer ScienceWrocław University of Technology 
  2. 2.College of Information Sciences and TechnologyPennsylvania State University 

Personalised recommendations