The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Fast signature generation with a Fiat Shamir—like scheme
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
SIAM Journal on Computing
Zero-Knowledge Authentication Scheme with Secret Key Exchange (Extended Abstract)
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Everything Provable is Provable in Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
How to Explain Zero-Knowledge Protocols to Your Children
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the (In)security of the Fiat-Shamir Paradigm
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A Fault-Injection Attack on Fiat-Shamir Cryptosystems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
From the simple example of Ali Baba proving he knows a magic word to complex digital signature schemes, the ideas behind zero-knowledge protocols can be used as fun cryptographic examples for undergraduate students at different levels. In this paper, I present an example of how to introduce the topic as an interactive classroom activity to an undergraduate mathematics class in a way that sets the stage for discussing several important topics of concern in this and other modern cryptographic applications.