
Advanced applications and protocols 391
Note that this last step is in fact a verification; that a
s
= hB
b
(mod p).
(a) Show that this satisfies the three prope rties of a zero knowledge
proof.
(b) Can Eve cheat and try to trick Victor to believe that she is Peggy?
12. One protocol for voting is given by Schneier [77]. Assume the existence
of a Central Tabulating Facility (CTF) which c ollects and counts the
votes. Here is the pro toc ol:
(a) Each voter encrypts his or her vote with the public key of the CTF.
(b) The voter than sends that result to the CTF.
(c) The CTF decrypts the votes (with its private key), counts the votes,
and announces the outcome.