How to Construct State Registries-Matching Undeniability with Public Security

被引:0
作者
Kubiak, Przemyslaw [1 ]
Kutylowski, Miroslaw [1 ]
Shao, Jun [2 ]
机构
[1] Wroclaw Univ Technol, Inst Math & Comp Sci, PL-50370 Wroclaw, Poland
[2] Penn State Univ, Coll Informat Sci & Technol, University Pk, PA 16802 USA
来源
INTELLIGENT INFORMATION AND DATABASE SYSTEMS, PT I, PROCEEDINGS | 2010年 / 5990卷
关键词
registry; secure system architecture; undeniability; group signatures; hash function; SIGNATURE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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).
引用
收藏
页码:64 / +
页数:2
相关论文
共 8 条
  • [1] Ateniese G, 2000, LECT NOTES COMPUT SC, V1880, P255
  • [2] CHAUM D, 1990, LECT NOTES COMPUT SC, V435, P212
  • [3] Contini Scott., 2005, VSH EFFICIENT PROVAB
  • [4] Frankel Y., 1998, Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, DOI 10.1145/277697.277779
  • [5] Huang XY, 2006, LECT NOTES COMPUT SC, V4307, P479
  • [6] Smith D, 2009, 2009 35TH EUROPEAN CONFERENCE ON OPTICAL COMMUNICATION (ECOC)
  • [7] Young A, 2005, LECT NOTES COMPUT SC, V3376, P7
  • [8] YOUNG A, 1997, LNCS, V1233, P62, DOI DOI 10.1007/3-540-69053-0