We put forward a new framework that makes it possible to re-write or compress the content
of any number of blocks in decentralized services exploiting the blockchain technology. As …

We construct a simple fully homomorphic encryption scheme, using only elementary
modular arithmetic. We use Gentry's technique to construct a fully homomorphic scheme …

A pseudorandom function F:\mathcalK*\mathcalX→\mathcalY is said to be key homomorphic
if given F (k 1, x) and F (k 2, x) there is an efficient algorithm to compute F (k 1⊕ k 2, x) …

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 …

This paper presents a generic conversion from weak asymmetric and symmetric encryption
schemes to an asymmetric encryption scheme that is chosen-ciphertext secure in the …

The topic of information theoretic security is introduced and the principal results in this area
are reviewed. The basic wire-tap channel model is considered first, and then several specific …

We propose a new general primitive called lossy trapdoor functions (lossy TDFs), and
realize it under a variety of different number theoretic assumptions, including hardness of the …

Non-interactive batch arguments for NP provide a way to amortize the cost of NP verification
across multiple instances. They enable a prover to convince a verifier of multiple NP …

In typical applications of homomorphic encryption, the first step consists for Alice of
encrypting some plaintext m under Bob's public key pk pk and of sending the ciphertext c …

We present a (probabilistic) public key encryption (PKE) scheme such that when being
implemented in a bilinear group, anyone is able to check whether two ciphertexts are …