Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/103418.103476acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free access

Perfect cryptographic security from partially independent channels

Published: 03 January 1991 Publication History
First page of PDF

References

[1]
C.H. Bennett, F. Bessette, G. Brassard, L. Salvail and J. Smolin, Experimental quantum cryptography, to appear in Journal of Cryptology.
[2]
C.H. Bennett, G. Brassard and J.-M. Robert, Privacy amplification by public discussion, SIAM Journal on Computing, Voi. 17, No. 2, 1988, pp. 210-229.
[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]
G. Brassard, Modern Cryptology: A Tutorial, Lecture Notes in Computer Science, Vol. 325, Berlin: Springer-Verlag, 1988.
[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]
R.G. Gallager, Information Theory and Reliable Communication, New York: John Witey & Sons, 1968.
[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]
U.M. Maurer, Conditionally-perfect secrecy and a provably-secure randomized cipher, to appear in Journal of Cryptology.
[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.

Cited By

View all
  • (2022)Byzantine Consensus Over Broadcast Channels2022 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT50566.2022.9834558(1157-1162)Online publication date: 26-Jun-2022
  • (2021)Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentrationAdvances in Cryptology – CRYPTO 202110.1007/978-3-030-84245-1_5(124-154)Online publication date: 11-Aug-2021
  • (2021)The Role of Common Randomness in Information Theory and Cryptography: Secrecy ConstraintsIdentification and Other Probabilistic Models10.1007/978-3-030-65072-8_14(207-229)Online publication date: 4-Mar-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing
January 1991
572 pages
ISBN:0897913973
DOI:10.1145/103418
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1991

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

STOC91
Sponsor:
STOC91: 23rd Annual ACM Symposium on Theory of Computing
May 5 - 8, 1991
Louisiana, New Orleans, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)46
  • Downloads (Last 6 weeks)12
Reflects downloads up to 10 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Byzantine Consensus Over Broadcast Channels2022 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT50566.2022.9834558(1157-1162)Online publication date: 26-Jun-2022
  • (2021)Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentrationAdvances in Cryptology – CRYPTO 202110.1007/978-3-030-84245-1_5(124-154)Online publication date: 11-Aug-2021
  • (2021)The Role of Common Randomness in Information Theory and Cryptography: Secrecy ConstraintsIdentification and Other Probabilistic Models10.1007/978-3-030-65072-8_14(207-229)Online publication date: 4-Mar-2021
  • (2020)Physical Layer Security in Multimode Fiber Optical NetworksScientific Reports10.1038/s41598-020-59625-910:1Online publication date: 17-Feb-2020
  • (2020)Cryptography from One-Way Communication: On Completeness of Finite ChannelsAdvances in Cryptology – ASIACRYPT 202010.1007/978-3-030-64840-4_22(653-685)Online publication date: 5-Dec-2020
  • (2020)A Probabilistic Error-Correcting Scheme that Provides Partial SecrecyComputational Complexity and Property Testing10.1007/978-3-030-43662-9_1(1-8)Online publication date: 4-Apr-2020
  • (2019)One-way information reconciliation schemes of quantum key distributionCybersecurity10.1186/s42400-019-0033-z2:1Online publication date: 22-May-2019
  • (2019)Composable, Unconditionally Secure Message Authentication without any Secret Key2019 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT.2019.8849510(622-626)Online publication date: Jul-2019
  • (2019)Secure Channels and Termination: The Last Word on TLSProgress in Cryptology – LATINCRYPT 201710.1007/978-3-030-25283-0_3(44-65)Online publication date: 20-Jul-2019
  • (2018)Maximal Correlation SecrecyIEEE Transactions on Information Theory10.1109/TIT.2018.281606664:5(3916-3926)Online publication date: May-2018
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media