Abstract Information security has become an important issue in the modern world due to its
increasing popularity in Internet commerce and communication technologies such as the …

Cloud storage service providers such as Dropbox, Mozy, and others perform deduplication
to save space by only storing one copy of each file uploaded. Should clients conventionally …

We examine a natural, but non-tight, reductionist security proof for deterministic message
authentication code (MAC) schemes in the multi-user setting. If security parameters for the …

The question whether there exist verifiable random functions with exponential-sized input
space and full adaptive security based on a non-interactive, constant-size assumption is a …

The RSA PKCS# 1 v1. 5 signature algorithm is the most widely used digital signature
scheme in practice. Its two main strengths are its extreme simplicity, which makes it very …

In many applications, it is important to verify that an RSA public key (N, e) specifies a
permutation over the entire space Z _N, in order to prevent attacks due to adversarially …

Abstract We address Partial Key Exposure attacks on CRT-RSA on secret exponents dp, dq
with small public exponent e. For constant e it is known that the knowledge of half of the bits …

Oblivious transfer (OT) is a foundational primitive within cryptography owing to its connection
with secure computation. One of the oldest constructions of oblivious transfer was from …

We show how to construct maliciously secure oblivious transfer (M-OT) from a strengthening
of key agreement (KA) which we call strongly uniform KA (SU-KA), where the latter roughly …

Abstract The Modular Inversion Hidden Number Problem (MIHNP), introduced by Boneh,
Halevi and Howgrave-Graham in Asiacrypt 2001, is briefly described as follows: Let MSB _ δ …