Notes - Burdens of Proof - page 225

60. Tim Bell et al., “Explaining Cryptographic Systems,” Computers & Education 40,
no. 3 (2003): 200.
61. Sid Stamm and Markus Jakobsson, “Privacy-Preserving Polling Using Playing
Cards,” Cryptology ePrint Archive, Report 2005/444, 1-2, available at http://eprint
.iacr.org/2005/444 (accessed June 24, 2011).
62. Jean-Jacques Quisquater et al., “How to Explain Zero-Knowledge Protocols to
Your Children,” in Advances in Cryptology—CRYPTO '89 , ed. by Gilles Brassard
(Berlin: Springer, 1990), 628-631. Given that it deals with communication in the
presence of adversaries, Fellows, Koblitz, and Brickell note that “implicit in any
discussion of cryptography are elements of drama, of theater, of suspense.” Fellows
and Koblitz, “Kid Krypto,” 371.
63. It may also open the door for amateurs to resume their contribution to the field.
Diffie and Hellman concluded “New Directions” with a recognition of the important
role of such outsiders: “The last characteristic which we note in the history of cryp-
tography is the division between amateur and professional cryptographers. Skill in
production cryptanalysis has always been heavily on the side of the professionals,
but innovation, particularly in the design of new types of cryptographic systems,
has come primarily from the amateurs. Thomas Jefferson, a cryptographic amateur,
invented a system which was still in use in World War II, while the most noted
cryptographic system of the twentieth century, the rotor machine, was invented
simultaneously by four separate people, all amateurs. We hope this will inspire
others to work in this fascinating area in which participation has been discouraged
in the recent past by a nearly total government monopoly.” Diffie and Hellman,
“New Directions in Cryptography,” 654. Today, one would probably talk of “a nearly
total academic monopoly.”
64. Fellows and Koblitz, “Kid Krypto,” 372.
65. Ibid., 373.
66. Ronald Fagin, Moni Naor, and Peter Winkler, “Comparing Information Without
Leaking It,” Communications of the ACM 39, no. 5 (1996): 79.
67. First articulated by Andrew C. Yao, “Protocols for Secure Computations,” in 23rd
IEEE Symposium on Foundations of Computer Science (Washington, DC: IEEE Society,
1982), 160: “Two millionaires wish to know who is richer; however, they do not
want to find out inadvertently any additional information about each other's
wealth. How can they carry out such a conversation?”
68. Fagin, Naor, and Winkler, “Comparing Information without Leaking It,” 79.
69. For example, solution 7: “Ron and Moshe [the managers] assign a random
telephone number to each candidate. Ron dials the phone number corresponding
to the person (Bob) who complained to him and asks to leave a message for Moshe.