Adaptive and composable non-interactive string-commitment protocols

Huafei Zhu; Tadashi Araragi; Takashi Nishide; Kouichi Sakurai

Adaptive and composable non-interactive string-commitment protocols

Huafei Zhu, Tadashi Araragi, Takashi Nishide, Kouichi Sakurai

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography
Pages	354-361
Number of pages	8
Publication status	Published - 2010
Event	International Conference on Security and Cryptography, SECRYPT 2010 - Athens, Greece Duration: Jul 26 2010 → Jul 28 2010

Publication series

Name	SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography

Other

Other	International Conference on Security and Cryptography, SECRYPT 2010
Country/Territory	Greece
City	Athens
Period	7/26/10 → 7/28/10

All Science Journal Classification (ASJC) codes

Computational Theory and Mathematics
Computer Science Applications

Cite this

Adaptive and composable non-interactive string-commitment protocols. / Zhu, Huafei; Araragi, Tadashi; Nishide, Takashi et al.
SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography. 2010. p. 354-361 (SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Zhu, H, Araragi, T, Nishide, T & Sakurai, K 2010, Adaptive and composable non-interactive string-commitment protocols. in SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography. SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography, pp. 354-361, International Conference on Security and Cryptography, SECRYPT 2010, Athens, Greece, 7/26/10.

@inproceedings{12cd11e31f00469e9b779097437bf6a3,

title = "Adaptive and composable non-interactive string-commitment protocols",

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.",

author = "Huafei Zhu and Tadashi Araragi and Takashi Nishide and Kouichi Sakurai",

year = "2010",

language = "English",

isbn = "9789898425188",

series = "SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography",

pages = "354--361",

booktitle = "SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography",

note = "International Conference on Security and Cryptography, SECRYPT 2010 ; Conference date: 26-07-2010 Through 28-07-2010",

}

TY - GEN

T1 - Adaptive and composable non-interactive string-commitment protocols

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=78651413422&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78651413422&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:78651413422

SN - 9789898425188

T3 - SECRYPT 2010 - Proceedings of the International Conference on Security and Cryptography

SP - 354

EP - 361

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 -

Adaptive and composable non-interactive string-commitment protocols

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this