ACM Home Page
Please provide us with feedback. Feedback
Perfect cryptographic security from partially independent channels
Full text PdfPdf (1.06 MB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-third annual ACM symposium on Theory of computing table of contents
New Orleans, Louisiana, United States
Pages: 561 - 571  
Year of Publication: 1991
ISBN:0-89791-397-3
Author
Ueli M. Maurer  Princeton Univ., Princeton, NJ
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 27,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/103418.103476
What is a DOI?

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
 
2
 
3
C.H. Bennett, G. Brassard, U.M. Manrer and L. Salvail, Generalized privacy amplification, in preparation.
 
4
R.E. Blahut, Theory and Practice of Error Control Codes, Reading, MA: Addison-Wesley, 1984.
 
5
 
6
I. CsiszAr and J. KSrner, Broadcast channels with confidential messages, IEEE Transactions on Information Theory, Vol. 24, No. 3, 1978, pp. 339-348.
 
7
W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Transactions on information Theory, Vol. 22, No. 6, 1976, pp. 644-654.
 
8
 
9
P.L. Heinzmann, Fiber optics and secure communications, IBM Research Report RZ 1759, Nov. 1988.
 
10
S.I#. Leung-Yan-Cheong, Multi-u#er and wiretap channels including feedback, Tech. R.ep. No. 6603-2, Stanford University, Information Systems Lab., July 1976.
 
11
J.L. Massey, A simplified treatment of Wyner's wire-tap channel, Proc. 21st Annual AlIerton Conf. on Comm., Control, and Computing, Monticello, IL, Oct. 5-7, 1983, pp. 268-276.
 
12
 
13
U.M. Maurer and J.L. Massey, Cascade ciphers: the importance of being first, submitted to Journal of Cryptology.
 
14
U.M. M#urer and J.L. Massey, Local randomness in pseudo-random sequences, to appear in Journal of Cryptology.
 
15
A. Orlitsky, Worst-case interactive communication I: two messages are almost optimal, IEEE Transactions on Information Theory, Vol. 36, No. 5, 1990, pp. 1111-1126.
 
16
C.E. Shannon, A mathematical theory of communication, Bell System Technical Journal, Vol. 27, No. 3, July 1948, pp. 379-423 and 623-656.
 
17
C.E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal, Vol. 28, Oct. 1949, pp. 656-715.
 
18
G.S. Vernam, Cipher printing telegraph systems for secret wire and radio telegraphic communications, J. Amer. Inst. Elec. Eng., Vol. 55, 1926, pp. 109-115.
 
19
M.N. Wegman and J.L. Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences, Vol. 22, 1981, pp. 265-279.
 
20
A.D. Wyner, The wire-tap channel, Bell System Technical Journal, Vol. 54, No. 8, 1975, pp. 1355- 1387.