32 search results - page 1 / 7 » Constructing Committed Signatures from Strong-RSA Assumption... |
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
ASIACRYPT
2011
Springer
12 years 4 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...