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 - 2012/3/2
Y1 - 2012/3/2
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=84863414611&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863414611&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-25206-8_18
DO - 10.1007/978-3-642-25206-8_18
M3 - Conference contribution
AN - SCOPUS:84863414611
SN - 9783642252051
T3 - Communications in Computer and Information Science
SP - 274
EP - 288
BT - e-Business and Telecommunications - 7th International Joint Conference, ICETE 2010, Revised Selected Papers
T2 - 7th International Joint Conference on e-Business and Telecommunications, ICETE 2010
Y2 - 26 July 2010 through 28 July 2010
ER -