We describe Charm, an extensible framework for rapidly prototyping cryptographic systems.
Charm provides a number of features that explicitly support the development of new …

We show the existence of indistinguishability obfuscators (iO) for general circuits assuming
subexponential security of:(a) the Learning with Errors (LWE) assumption (with …

We show how to obfuscate a large and expressive class of programs, which we call compute-
and-compare programs, under the learning-with-errors (LWE) assumption. Each such …

TLS is possibly the most used protocol for secure communications, with a 18-year history of
flaws and fixes, ranging from its protocol logic to its cryptographic design, and from the …

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 …

In this paper we introduce the notion of lockable obfuscation. In a lockable obfuscation
scheme there exists an obfuscation algorithm Obf that takes as input a security parameter, a …

A common requirement in practice is to periodically rotate the keys used to encrypt stored
data. Systems used by Amazon and Google do so using a hybrid encryption technique …

Abstract The TLS Internet Standard features a mixed bag of cryptographic algorithms and
constructions, letting clients and servers negotiate their use for each run of the handshake …

This paper provides a (standard-model) notion of security for (keyed) hash functions, called
UCE, that we show enables instantiation of random oracles (ROs) in a fairly broad and …

Yao's garbled-circuit approach enables constant-round secure two-party computation of any
function. In Yao's original construction, each gate in the circuit requires the parties to perform …