Moni Naor

TL;DR: The complexity of the construction and proof are reduced and its proof of security is simplified by showing that two Feistel permutations are sufficient together with initial and final pair-wise independent permutations.

TL;DR: In this article, the authors studied the problem of preserving the solution to an instance of a problem rather than preserving the instance itself and showed that SAT is compressible if there exists a polynomial p(middot, middot) formula of size at most p(n, log m).

TL;DR: It is shown that compressibility (say, of SAT) would have vast implications for cryptography, including constructions of one-way functions and collision resistant hash functions from any hard-on-average problem in $\mathcal{NP}$ and cryptanalysis of key agreement protocols in the “bounded storage model” when mixed with (time) complexity-based cryptography.

TL;DR: In this paper, the authors proposed a method for secure accounting and auditing of a communications network that operates in an environment in which many servers serve an even larger number of clients (e.g. the web), and are required to meter the interaction between servers and clients.

TL;DR: An environment in which many servers serve an even larger number of clients, and it is required to meter the interaction between servers and clients is considered, based on efficient cryptographic techniques several secure and efficient constructions of metering systems are suggested.