We put forward a new algebraic framework to generalize and analyze Diffie–Hellman like
decisional assumptions which allows us to argue about security and applications by …

We study the problem of a public key encryption with conjunctive keyword search (PECK).
The keyword searchable encryption enables a user to outsource his data to the storage of …

A modular approach for cryptographic protocols leads to a simple design but often inefficient
constructions. On the other hand, ad hoc constructions may yield efficient protocols at the …

Non-interactive zero-knowledge proofs play an essential role in many cryptographic
protocols. We suggest several NIZK proof systems based on prime order groups with a …

Abstract In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called
proxy re-encryption, in which a proxy transforms–without seeing the corresponding plaintext …

We put forward a new paradigm for building hybrid encryption schemes from constrained
chosen-ciphertext secure (CCCA) key-encapsulation mechanisms (KEMs) plus …

In this paper we consider anonymity in the context of Broadcast Encryption (BE). This issue
has received very little attention so far and all but one of the currently available BE schemes …

We construct a new group signature scheme using bilinear groups. The group signature
scheme is practical, both keys and group signatures consist of a constant number of group …

We present the first CCA-secure public-key encryption scheme based on DDH where the
security loss is independent of the number of challenge ciphertexts and the number of …

Group signatures are a central cryptographic primitive where users can anonymously and
accountably sign messages in the name of a group they belong to. Several efficient …