The industrial and computing research context revolutionized in various directions during
the last decades. The blockchain-based smart contract embraced as a significant research …

We formalize a new cryptographic primitive that we call Message-Locked Encryption (MLE),
where the key under which encryption and decryption are performed is itself derived from …

RSA and DSA can fail catastrophically when used with malfunctioning random number
generators, but the extent to which these problems arise in practice has never been …

We introduce CHURP (CHUrn-Robust Proactive secret sharing). CHURP enables secure
secret-sharing in dynamic settings, where the committee of nodes storing a secret changes …

We introduce honey encryption (HE), a simple, general approach to encrypting messages
using low min-entropy keys such as passwords. HE is designed to produce a ciphertext …

We exhibit a hash-based storage auditing scheme which is provably secure in the random-
oracle model (ROM), but easily broken when one instead uses typical indifferentiable hash …

Motivated by the problem of avoiding duplication in storage systems, Bellare, Keelveedhi,
and Ristenpart have recently put forward the notion of Message-Locked Encryption (MLE) …

In December 2015, Juniper Networks announced multiple security vulnerabilities stemming
from unauthorized code in ScreenOS, the operating system for their NetScreen VPN routers …

We put forward a new notion, function privacy, in identity-based encryption and, more
generally, in functional encryption. Intuitively, our notion asks that decryption keys reveal …

Random number generators (RNGs) are consistently a weak link in the secure use of
cryptography. Routine cryptographic operations such as encryption and signing can fail …