International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Wenbo Mao

Affiliation: Hewlett-Packard Labs

Publications

Year
Venue
Title
2003
EPRINT
Universal Padding Schemes for RSA with Optimal Bandwidth of Message Recovery
Wenbo Mao John Malone-Lee
We prove that three OAEP-inspired randomised padding schemes (i.e., OAEP, OAEP+ and SAEP), when used with the RSA function in the trapdoor direction, form provably secure signature schemes with message recovery. Two of our three reductionist proofs are tight and hence provide exact security. Because of the exact security and OAEP's optimally high bandwidth for message recovery, our results form a desirable improvement from a previous universal RSA padding scheme good for both encryption and signature.
2001
EPRINT
New Zero-knowledge Undeniable Signatures - Forgery of Signature Equivalent to Factorisation
Wenbo Mao
We propose a new zero-knowledge undeniable signature scheme which is based on the intractability of computing high-order even powers modulo a composite. The new scheme has a number of desirable properties: (i) forgery of a signature (including existential forgery) is proven to be equivalent to factorisation, (ii) perfect zero-knowledge, (iii) efficient protocols for signature verification and non-signature denial: both measured by $O(\log k)$ (multiplications) where $1/k$ bounds the probability of error. For a denial protocol, this performance is unprecedented.
2001
EPRINT
Timed-Release Cryptography
Wenbo Mao
Let $n$ be a large composite number. Without factoring $n$, the validation of $a^{2^t} (\bmod \, n)$ given $a$, $t$ with $gcd(a, n) = 1$ and $t < n$ can be done in $t$ squarings modulo $n$. For $t \ll n$ (e.g., $n > 2^{1024}$ and $t < 2^{100}$), no lower complexity than $t$ squarings is known to fulfill this task (even considering massive parallelisation). Rivest et al suggested to use such constructions as good candidates for realising timed-release crypto problems. We argue the necessity for zero-knowledge proof of the correctness of such constructions and propose the first practically efficient protocol for a realisation. Our protocol proves, in $\log_2 t$ standard crypto operations, the correctness of $(a^e)^{2^t} (\bmod\,n)$ with respect to $a^e$ where $e$ is an RSA encryption exponent. With such a proof, a {\em Timed-release RSA Encryption} of a message $M$ can be given as $a^{2^t} M (\bmod \,n)$ with the assertion that the correct decryption of the RSA ciphertext $M^e (\bmod \, n)$ can be obtained by performing $t$ squarings modulo $n$ starting from $a$. {\em Timed-release RSA signatures} can be constructed analogously.
1998
ASIACRYPT
1998
PKC
1994
ASIACRYPT
1993
EUROCRYPT

Program Committees

Eurocrypt 2008
PKC 2008
PKC 2006
Asiacrypt 2006
PKC 2005
PKC 2004
Asiacrypt 2002
Asiacrypt 2001

Coauthors

Colin Boyd (2)
Chae Hoon Lim (1)
John Malone-Lee (1)