44 search results - page 1 / 9 » A Multi-trapdoor Commitment Scheme from the RSA Assumption |
ACISP
2010
Springer
13 years 7 months ago
2010
Springer
STOC
2003
ACM
14 years 6 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...
PKC
2004
Springer
13 years 11 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
2000
Springer
13 years 9 months ago
2000
Springer
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly availab...
ASIACRYPT
2011
Springer
12 years 5 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 ...