Implementing an Electronic Notary Public
Many communication security problems admit both “physical” and “mathematical” solutions. For example sending a message from A to B without exposing it to C, can be accomplished physically by means of secure courier, or mathematically by means of encryption. With the advent of public key cryptography, many problems originally believed to be solvable only by physical means have been shown to have mathematical solutions (e.g. key distribution [DB], secret sharing [S], coin flipping [B], mental poker playing [SRA]), In this paper we describe a mathematical solution to a communication security problem, which arose in connection with the Nuclear Test Ban Treaty, and for which only physical solutions were known, The problem concerns the implementation of an electronic notary public - a device which can certify information for a group of mutually distrusting parties - among which may be builder of the device.
KeywordsTrojan Horse Notary Public Mathematical Solution Geiger Counter Intended Algorithm
Unable to display preview. Download preview PDF.
- [B]Blum, R., “How to Exchange (Secret Keys)” ERL Technical Memo UCB/ERL M81/90.Google Scholar
- [DH]Diffie, W. and Hellman, M., “New Directions in Cryptography,” IEEE Trans. Inform. Theory, Vol. IT-22, Nov. 1976.Google Scholar
- [M]Miller, G.L., “Riemann’s Hypothesis and Tests for Primality,” Proc. Seventh Annual ACM Symp. on the Theory of Computing. Albuquerque, New Mexico, May 1975, pp. 234–239; extended vers. available as Res. Rep. CS-75–27, Dept. of Computer Science, University of Waterloo, Waterloo, Ont., Canada, Oct. 1975.Google Scholar
- [SRA]Shamir, A. Rivest, R. and Adleman, L.M., “Mental Poker,” MIT/LCS/TM-125.Google Scholar