Injective one-way trapdoor functions are one of the most fundamental cryptographic primitives. In this work we show how to derandomize lossy encryption (with long messages) to obtain lossy trapdoor functions, and hence injective one-way trapdoor functions. Bellare, Halevi, Sahai and Vadhan (CRYPTO ’98) showed that if Enc is an IND-CPA secure cryptosystem, and H is a random oracle, then x 7→ Enc...

A theory of di erential characters is developed for manifolds with boundary. This is done from both the Cheeger-Simons and the deRham-Federer viewpoints. The central result of the paper is the formulation and proof of a Lefschetz-Pontrjagin Duality Theorem, which asserts that the pairing c IHk(X; @X) c IHn k 1(X) ! S1 given by ( ; ) 7! ( ) [X] induces isomorphisms D : c IHk(X; @X)! Hom1(c IHn k...