Abstract
Methods are given by which personal data about a large number of individuals can be registered in a large central database without having to trust this register not to give away information linked to a given individual. Personal information arriving from many different sources can be placed correctly in the register. The registration is done in a verifiable way: Each individual can be given access to the register to check that his information is correct, and can even, if he chooses to do so, prove to anyone that he is or is not identical to a given person in the register. This can all be done without compromising the anonymity of any other individual.
This research was supported by the Danish Natural Science Research Council.
Chapter PDF
Similar content being viewed by others
References
G. Brassard, D. Chaum and C. Crepeau: “Minimum Disclosure Proofs of Knowledge”, tech. report PM-R8710, CWI, Amsterdam 1987.
G. Brassard and C. Crepeau: “Non-Transitive Transfer of Confidence: a perfect zero-knowledge Protocol for SAT and beyond”, Proc. of FOCS 86, pp.188–195.
D. Chaum: “Security Without Identification: Transaction Systems to make Big Brother Obsolete”, CACM, vol28, 1985.
I. Damgård: “The Application of Clawfree Functions in Cryptography; Unconditional Protection in Cryptographic Protocols”, Ph.D-thesis, Aarhus University, 1988.
J. Hastad: “On Using RSA with Low Exponent in a Public Key Network”, Proceedings of Crypto 85, Springer.
M. Boppana and L. Lagarias: “One Way Functions and Circuit Complexity”, Information and Computation, vol 74, pp.226–240, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandt, J., Damgård, I.B., Landrock, P. (1988). Anonymous and Verifiable Registration in Databases. In: Barstow, D., et al. Advances in Cryptology — EUROCRYPT ’88. EUROCRYPT 1988. Lecture Notes in Computer Science, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45961-8_14
Download citation
DOI: https://doi.org/10.1007/3-540-45961-8_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50251-7
Online ISBN: 978-3-540-45961-3
eBook Packages: Springer Book Archive