Lossy Trapdoor Functions
705 views · Published 12 August 2016 · 59:24 · Indexed 21 October 2026
Channel: Microsoft Research · 2016 · Science & Technology
Lossy Trapdoor Functions (LTFs) were introduced by Peikert and Waters in STOC '08, and since that time they have become an extremely useful cryptographic primitive. Lossy Trapdoor Functions yield simple constructions of pseudorandom generators, collision resistant hash functions, IND-CCA secure cryptosystems, deterministic encryption, leaky pseudoentropy functions and more. In this talk, I'll show a number of new constructions of LTFs from a variety of cryptographic primitives and number theoretic assumptions. These constructions can be cast into two broad categories: exploiting (group) homomorphisms of common cryptosystems, and derandomizing randomized lossy primitives.