@inproceedings{450926f3222e4f8d8c740be8bfca499f,
title = "On pseudorandom encodings",
abstract = "We initiate a study of pseudorandom encodings: efficiently computable and decodable encoding functions that map messages from a given distribution to a random-looking distribution. For instance, every distribution that can be perfectly and efficiently compressed admits such a pseudorandom encoding. Pseudorandom encodings are motivated by a variety of cryptographic applications, including password-authenticated key exchange, “honey encryption” and steganography. The main question we ask is whether every efficiently samplable distribution admits a pseudorandom encoding. Under different cryptographic assumptions, we obtain positive and negative answers for different flavors of pseudorandom encodings, and relate this question to problems in other areas of cryptography. In particular, by establishing a two-way relation between pseudorandom encoding schemes and efficient invertible sampling algorithms, we reveal a connection between adaptively secure multiparty computation for randomized functionalities and questions in the domain of steganography.",
author = "Thomas Agrikola and Geoffroy Couteau and Yuval Ishai and Stanis{\l}aw Jarecki and Amit Sahai",
note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2020.; 18th International Conference on Theory of Cryptography, TCCC 2020 ; Conference date: 16-11-2020 Through 19-11-2020",
year = "2020",
doi = "10.1007/978-3-030-64381-2_23",
language = "الإنجليزيّة",
isbn = "9783030643805",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "639--669",
editor = "Rafael Pass and Krzysztof Pietrzak",
booktitle = "Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings",
address = "ألمانيا",
}