Anonymous and Verifiable Registration in Databases
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.
- [BrChCr]G. Brassard, D. Chaum and C. Crepeau: “Minimum Disclosure Proofs of Knowledge”, tech. report PM-R8710, CWI, Amsterdam 1987.Google Scholar
- [BrCr]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.Google Scholar
- [Ch]D. Chaum: “Security Without Identification: Transaction Systems to make Big Brother Obsolete”, CACM, vol28, 1985.Google Scholar
- [Da]I. Damgård: “The Application of Clawfree Functions in Cryptography; Unconditional Protection in Cryptographic Protocols”, Ph.D-thesis, Aarhus University, 1988.Google Scholar
- [Ha]J. Hastad: “On Using RSA with Low Exponent in a Public Key Network”, Proceedings of Crypto 85, Springer.Google Scholar