Book contents
- Frontmatter
- Contents
- Preface
- Notation
- 1 Basics of cryptography
- 2 Complexity theory
- 3 Non-deterministic computation
- 4 Probabilistic computation
- 5 Symmetric cryptosystems
- 6 One way functions
- 7 Public key cryptography
- 8 Digital signatures
- 9 Key establishment protocols
- 10 Secure encryption
- 11 Identification schemes
- Appendix 1 Basic mathematical background
- Appendix 2 Graph theory definitions
- Appendix 3 Algebra and number theory
- Appendix 4 Probability theory
- Appendix 5 Hints to selected exercises and problems
- Appendix 6 Answers to selected exercises and problems
- Bibliography
- Index
11 - Identification schemes
Published online by Cambridge University Press: 06 July 2010
- Frontmatter
- Contents
- Preface
- Notation
- 1 Basics of cryptography
- 2 Complexity theory
- 3 Non-deterministic computation
- 4 Probabilistic computation
- 5 Symmetric cryptosystems
- 6 One way functions
- 7 Public key cryptography
- 8 Digital signatures
- 9 Key establishment protocols
- 10 Secure encryption
- 11 Identification schemes
- Appendix 1 Basic mathematical background
- Appendix 2 Graph theory definitions
- Appendix 3 Algebra and number theory
- Appendix 4 Probability theory
- Appendix 5 Hints to selected exercises and problems
- Appendix 6 Answers to selected exercises and problems
- Bibliography
- Index
Summary
Introduction
How should Peggy prove to Victor that she is who she claims to be?
There is no simple answer to this question, it depends on the situation. For example if Peggy and Victor meet in person, she may show him her passport (hopefully issued by an authority that he trusts). Alternatively she could present him with a fingerprint or other biometric information which he could then check against a central database. In either case it should be possible for Peggy to convince Victor that she really is Peggy. This is the first requirement of any identification scheme: honest parties should be able to prove and verify identities correctly.
A second requirement is that a dishonest third party, say Oscar, should be unable to impersonate Peggy. For example, two crucial properties of any passport are that it is unforgeable and that its issuring authority can be trusted not to issue a fake one. In the case of biometrics Victor needs to know that the central database is correct.
A special and rather important case of this second requirement arises when Victor is himself dishonest. After asking Peggy to prove her identity, Victor should not be able to impersonate her to someone else.
- Type
- Chapter
- Information
- Complexity and CryptographyAn Introduction, pp. 229 - 249Publisher: Cambridge University PressPrint publication year: 2006