Paper 2020/462
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption
Ido Shahaf, Or Ordentlich, and Gil Segev
Abstract
Motivated by a fundamental paradigm in cryptography, we consider a recent variant of the classic problem of bounding the distinguishing advantage between a random function and a random permutation. Specifically, we consider the problem of deciding whether a sequence of
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. 2020 IEEE International Symposium on Information Theory (ISIT)
- Contact author(s)
- ido shahaf @ cs huji ac il
- History
- 2020-04-24: last of 3 revisions
- 2020-04-24: received
- See all versions
- Short URL
- https://ia.cr/2020/462
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/462, author = {Ido Shahaf and Or Ordentlich and Gil Segev}, title = {An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/462}, year = {2020}, url = {https://eprint.iacr.org/2020/462} }