Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
The main results of this work are new public-key encryption schemes that, under the quadratic residuosity (QR) assumption (or Paillier's decisional composite residuosity (DCR...
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
PICNIC is a tool for verifying security properties of systems, namely non-interference properties of processes expressed as terms of the π-calculus with two security levels and d...
To reason about information flow based on beliefs, a new model is developed that describes how attacker beliefs change due to the attacker’s observation of the execution of a p...
Michael R. Clarkson, Andrew C. Myers, Fred B. Schn...