TY - GEN
T1 - Universally composable non-committing encryptions in the presence of adaptive adversaries
AU - Zhu, Huafei
AU - Araragi, Tadashi
AU - Nishide, Takashi
AU - Sakurai, Kouichi
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=78651447246&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78651447246&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:78651447246
SN - 9789898425188
T3 - SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography
SP - 389
EP - 398
BT - SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography
T2 - International Conference on Security and Cryptography, SECRYPT 2010
Y2 - 26 July 2010 through 28 July 2010
ER -