We construct an efficient identity based encryption system based on the standard learning
with errors (LWE) problem. Our security proof holds in the standard model. The key step in …

As a beginning graduate student, I recall being frustrated by a general lack of acces sible
sources from which I could learn about (theoretical) cryptography. I remember wondering …

Attribute-based cryptography is a natural solution for fine-grained access control with
respect to security policies. In the case of attribute-based signatures (ABS), users obtain …

Abstract Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge
sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements …

Abstract Structure-preserving signatures (SPS) are signature schemes where messages,
signatures and public keys all consist of elements of a group over which a bilinear map is …

We present the first signature scheme which is “short”, stateless and secure under the RSA
assumption in the standard model. Prior short, standard model signatures in the RSA setting …

Group signatures are a central cryptographic primitive, simultaneously supporting
accountability and anonymity. They allow users to anonymously sign messages on behalf of …

We propose a general framework that converts (ordinary) signature schemes having certain
properties into linearly homomorphic signature schemes, ie, schemes that allow …

Hash functions have always attracted a lot of attention in modern cryptography because of
their hard to invert nature. However, all previous constructions of cryptographic primitives …

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 …