Lists that are smaller than their parts: A coding approach to tunable
secrecy

Lists that are smaller than their parts: A coding approach to tunable secrecy

Allerton Conference on Communication, Control, and Computing (Allerton), 2012

8 October 2012

Flavio du Pin Calmon

Mark M. Christiansen

ArXiv (abs)PDF HTML

Papers citing "Lists that are smaller than their parts: A coding approach to tunable secrecy"

6 / 6 papers shown

Title
Perfect message authentication codes are robust to small deviations from uniform key distributions Boris Ryabko 24 0 0 13 Aug 2025
Unconditionally secure ciphers with a short key for a source with unknown statisticsIACR Cryptology ePrint Archive (IACR ePrint), 2023 B. Ryabko 56 1 0 27 Mar 2023
Syfer: Neural Obfuscation for Private Data Release Adam Yala Victor Quach H. Esfahanizadeh Rafael G. L. DÓliveira K. Duffy Muriel Médard Tommi Jaakkola Regina Barzilay PICV 198 7 0 28 Jan 2022
Using data compression and randomization to build an unconditionally secure short key cipherInformation Theory Workshop (ITW), 2021 B. Ryabko 158 1 0 19 Dec 2021
Maximal Correlation SecrecyInternational Symposium on Information Theory (ISIT), 2014 Cheuk Ting Li A. Gamal 115 23 0 17 Dec 2014
Brute force searching, the typical set and Guesswork Mark M. Christiansen K. Duffy Flavio du Pin Calmon Muriel Médard 166 15 0 27 Jan 2013