Universally Composable Non-committing Encryptions in the Presence of Adaptive Adversaries
Lists
Only you see this
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.
BibTeX
@inproceedings{zhu2010universally,
author = {Huafei Zhu and Tadashi Araragi and Takashi Nishide and Kouichi Sakurai},
title = {{Universally Composable Non-committing Encryptions in the Presence of Adaptive Adversaries}},
booktitle = {ICETE (Selected Papers)},
year = {2010},
doi = {10.1007/978-3-642-25206-8\_18},
}Loading related content...