Conditionally-perfect secrecy and a provably-secure randomized cipher.

*(English)*Zbl 0746.94013The design of both practical and provably secure cryptosystems is known to be a hard task, especially if one excludes various contributes to the effort by demonstrating that slightly relaxing the notion of perfect secrecy together with an assumption on computational limitations of the enemy allows for building a provably secure cipher whose secret key is short compared to the length of plaintext. The relaxation consists of replacing “perfect secrecy” notion by “perfect with high probability” one. One such cipher is described and proof of its information-theoretic security against all feasible attacks is given.

Reviewer: J.Vyskoc (Bratislava)

##### MSC:

94A60 | Cryptography |

##### Keywords:

randomized encryption; practical and provably secure cryptosystems; perfect secrecy; provably secure cipher; perfect with high probability
Full Text:
DOI

##### References:

[1] | Bennett, C. H.; Bessette, F.; Brassard, G.; Savail, L.; Smolin, J., Experimental quantum cryptography, Advances in Cryptology—Eurocrypt ’90, 253-265 (1991), Berlin: Springer-Verlag, Berlin |

[2] | Bennett, C. H.; Brassard, G.; Robert, J.-M., Privacy amplification by public discussion, SIAM Journal on Computing, Vol. 17, No. 2, 210-229 (1988) · Zbl 0644.94010 |

[3] | Massey, J. L., An introduction to contemporary cryptology, Proceedings of the IEEE, Vol. 76, No. 5, 533-549 (1988) |

[4] | J. L. Massey and I. Ingemarsson, The Rip van Winkle cipher—a simple and provably computationally secure cipher with a finite key, in IEEE Int. Symp. Inform. Theory, Brighton, England (Abstracts), June 24-28, 1985, p. 146. |

[5] | U. M. Maurer, Perfect cryptographic security from partially independent channels, Proc. 23rd ACM Symp. on Theory of Computing, 1991, pp. 561-571. |

[6] | U. M. Maurer and J. L. Massey, Local randomness in pseudo-random sequences, Journal of Cryptology (to appear). · Zbl 0719.65003 |

[7] | U. M. Maurer and J. L. Massey, Cascade ciphers: the importance of being first, presented at the 1990 IEEE Int. Symp. Inform. Theory, San Diego, CA, Jan. 14-19, 1990. |

[8] | Ozarow, L. H.; Wyner, A. D., Wire-tap channel II, AT&T Bell Laboratories Technical Journal, Vol. 63, No. 10, 2135-2157 (1984) · Zbl 0587.94013 |

[9] | Shannon, C. E., Communication theory of secrecy systems, Bell Systems Technical Journal, Vol. 28, 656-715 (1949) · Zbl 1200.94005 |

[10] | Vernam, G. S., Cipher printing telegraph systems for secret wire and radio telegraphic communications, J. American Inst. Elec. Eng., Vol. 55, 109-115 (1926) |

[11] | Wegener, I., The Complexity of the Boolean Function (1987), New York: Wiley, New York |

[12] | Wyner, A., The wire-tap channel, Bell Systems Technical Journal, Vol. 54, No. 8, 1355-1387 (1975) · Zbl 0316.94017 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.