31 search results - page 2 / 7 » Efficient Non-malleable Commitment Schemes |
118
Voted
CRYPTO
2000
Springer
15 years 7 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...
110
Voted
STOC
2003
ACM
16 years 4 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...
114
Voted
IJNSEC
2008
15 years 4 months ago
2008
We present a new short signature scheme based on a variant of the Boneh-Boyen's short signatures schemes. Our short signature scheme is secure without requiring the random or...
109
Voted
JOC
2010
14 years 10 months ago
2010
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
115
click to vote
ACNS
2007
Springer
15 years 8 months ago
2007
Springer
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...