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 propose a new notion of secure multiparty computation aided by a computationally-
powerful but untrusted" cloud" server. In this notion that we call on-the-fly multiparty …

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 …

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 …

Most of the work in the analysis of cryptographic schemes is concentrated in abstract
adversarial models that do not capture side-channel attacks. Such attacks exploit various …

ZEBRA is an Anonymous Credential (AC) scheme, supporting auditability and revocation,
that provides practical on-chain verification for the first time. It realizes efficient access …

We say that a cryptographic scheme is Continuous Leakage-Resilient (CLR), if it allows
users to refresh their secret keys, using only fresh local randomness, such that: 1. The …

We construct the first public-key encryption (PKE) scheme whose chosen-ciphertext (ie, IND-
CCA) security can be proved under a standard assumption and does not degrade in either …

Motivated by the subversion of “trusted” public parameters in mass-surveillance activities,
this paper studies the security of NIZKs in the presence of a maliciously chosen common …

Consider encrypting n inputs under n independent public keys. Given the ciphertexts {c_i=
Enc _ pk _i (x_i)\} _i, Alice outputs ciphertexts c'_1, ..., c'_n that decrypt to y_1, ..., y_n …