Name
Abstract | ||
|---|---|---|
Designing non-committing encryptions tolerating adaptive adversaries is a challenging task. In this paper, a simple implementation of non-committing encryptions is presented and analyzed in the strongest security model. We show that the proposed non-committing encryption scheme is provably secure against adaptive adversaries in the universally composable framework assuming that the decisional Diffie-Hellman problem is hard. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-25206-8_15 | SECRYPT |
Keywords | Field | DocType |
security model,computational modeling,provable security,public key,protocols | Computer science,Computer security,Computer network,Encryption,Public-key cryptography,Computer security model | Conference |
Volume | ISSN | Citations |
222 | 1865-0929 | 0 |
PageRank | References | Authors |
0.34 | 18 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huafei Zhu | 1 | 181 | 28.38 |
| Tadashi Araragi | 2 | 42 | 9.18 |
| Takashi Nishide | 3 | 357 | 27.86 |
| Kouichi Sakurai | 4 | 1514 | 213.71 |