Bruce M. Kapron

On a variant of multilinear modular hashing with applications to authentication and secrecy codes

2016 · International Symposium on Information Theory and its Applications

Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. As a well known family, one can mention MMH∗ which was shown to be Δ-universal by Halevi and Krawczyk …

Reproducible Circularly-Secure Bit Encryption: Applications and Realizations.

2015 · IACR Cryptology ePrint Archive

Abstract. We give generic constructions of several fundamental cryptographic primitives based on a new encryption primitive that combines circular security for bit encryption with the so-called repro-ducibility property (Bellare et al. PKC 2003). At the …