KIT | KIT-Bibliothek | Impressum | Datenschutz

On Pseudorandom Encodings

Agrikola, Thomas; Couteau, Geoffroy; Ishai, Yuval; Jarecki, Stanisław; Sahai, Amit


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 twoway 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.

Volltext §
DOI: 10.5445/IR/1000129644
Veröffentlicht am 15.02.2021
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Theoretische Informatik (ITI)
Kompetenzzentrum für angewandte Sicherheitstechnologie (KASTEL)
Publikationstyp Forschungsbericht/Preprint
Publikationsjahr 2020
Sprache Englisch
Identifikator KITopen-ID: 1000129644
Umfang 73 S.
Serie Cryptology ePrint Archive: Report ; 2020/445
Vorab online veröffentlicht am 09.12.2020
Relationen in KITopen
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page