Name
Abstract | ||
|---|---|---|
This paper aims to find a proper security notion for commitment schemes to give a sound computational interpretation of symbolic commitments. We introduce an indistinguishability based security definition of commitment schemes that is equivalent to non-malleability with respect to commitment. Then, we give a construction using tag-based encryption and one-time signatures that is provably secure assuming the existence of trapdoor permutations. Finally, we apply this new machinery to give a sound interpretation of symbolic commitments in the Dolev-Yao model while considering active adversaries. |
Year | Venue | Keywords |
|---|---|---|
2008 | ISPEC | new machinery,sound computational interpretation,dolev-yao model,non-malleable commitment,security definition,computational soundness,commitment scheme,sound interpretation,active adversary,symbolic commitment,one-time signature,proper security notion,provable security |
Field | DocType | Volume |
Computer security,Computer science,Permutation,Commitment scheme,Encryption,Cryptographic primitive,Theoretical computer science,Soundness | Conference | 4991 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-79103-5 | 8 |
PageRank | References | Authors |
0.44 | 23 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Galindo | 1 | 391 | 23.03 |
| Flavio D. Garcia | 2 | 438 | 33.08 |
| Peter Van Rossum | 3 | 427 | 27.10 |