Abstract
Suppose Alice has a password and wants to log in to a website run by Bob, but she does not quite trust the computer Bob is using to verify the password. If she just sends the password to Bob then Bob’s computer will learn the whole password. To get around this problem one often sees websites that ask for the first, fourth and tenth letter of a password one time, and then maybe the first, second and fifth the second time and so on. In this way Bob’s computer only learns three letters at a time. So the password can be checked but in each iteration of checking only three letters are leaked. It clearly would be better if Bob could verify that Alice has the password in such a way that Alice never has to reveal any of the password to Bob. This is the problem this chapter will try to solve.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Smart, N.P. (2016). Zero-Knowledge Proofs. In: Cryptography Made Simple. Information Security and Cryptography. Springer, Cham. https://doi.org/10.1007/978-3-319-21936-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-21936-3_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21935-6
Online ISBN: 978-3-319-21936-3
eBook Packages: Computer ScienceComputer Science (R0)