|
 ABSTRACT
According to traditional conceptions of cryptographic security, it is necessary to transmit a key, by secret means, before encrypted massages can be sent securely. This paper shows that it is possible to select a key over open communications channels in such a fashion that communications security can be maintained. A method is described which forces any enemy to expend an amount of work which increases as the square of the work required of the two communicants to select the key. The method provides a logically new kind of protection against the passive eavesdropper. It suggests that further research on this topic will be highly rewarding, both in a theoretical and a practical sense.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Diffie, W., and Hellman, M. New directions in cryptography. IEEE Trans. on Inform. IT-22, 6 (Nov. 1976), 644-654.
|
| |
2
|
Feistel, H. Cryptography and computer privacy. Sci. Amer. 228, 5 (May 1973), 15-23.
|
| |
3
|
Kahn, D. The Codebreakers. MacMillan, New York, 1976.
|
| |
4
|
Merkle, R., and Hellman, M. Hiding information and receipts in trap door knapsacks. To appear, IEEE Trans. on Inform.
|
 |
5
|
|
| |
6
|
Shannon, C.E. Communication theory of secrecy systems. Bell Syst. Tech. J. 28 (1949), 654-715.
|
| |
7
|
Wyner, A.D. The wire tap channel. Bell Syst. Tech. J. 54, 8 (Oct. 1975), 1355-1387.
|
CITED BY 44
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Miguel Castro , Peter Druschel , Ayalvadi Ganesh , Antony Rowstron , Dan S. Wallach, Secure routing for structured peer-to-peer overlay networks, Proceedings of the 5th symposium on Operating systems design and implementation Due to copyright restrictions we are not able to make the PDFs for this conference available for downloading, December 09-11, 2002, Boston, Massachusetts
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yang Xiao , Venkata Krishna Rayi , Bo Sun , Xiaojiang Du , Fei Hu , Michael Galloway, A survey of key management schemes in wireless sensor networks, Computer Communications, v.30 n.11-12, p.2314-2341, September, 2007
|
|
|
Edward Bortnikov , Maxim Gurevich , Idit Keidar , Gabriel Kliot , Alexander Shraer, Brahms: byzantine resilient random membership sampling, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, August 18-21, 2008, Toronto, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Edward Bortnikov , Maxim Gurevich , Idit Keidar , Gabriel Kliot , Alexander Shraer, Brahms: Byzantine resilient random membership sampling, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.53 n.13, p.2340-2359, August, 2009
|
|
|
|
|
|
|
|
|
|
INDEX TERMS
Primary Classification:
K.
Computing Milieux
K.6
MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS
Additional Classification:
C.
Computer Systems Organization
C.2
COMPUTER-COMMUNICATION NETWORKS
C.2.0
General
Subjects:
Security and protection (e.g., firewalls)
D.
Software
D.4
OPERATING SYSTEMS
E.
Data
E.3
DATA ENCRYPTION
General Terms:
Design,
Performance,
Security,
Theory
Keywords:
communications security,
computer network security,
cryptography,
cryptology,
key distribution,
passive eavesdropping,
public key cryptosystem,
security,
wiretap
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf