Adaptive and composable non-committing encryptions

Huafei Zhu, Tadashi Araragi, Takashi Nishide, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

In this paper, a new non-committing encryption protocol without failure during the course of a channel setup procedure is constructed and analyzed in the universally composable (UC) framework. We show that the proposed non-committing scheme realizes the UC-security in the presence of adaptive adversary assuming that the decisional Diffie-Hellman problem is hard.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 15th Australasian Conference, ACISP 2010, Proceedings
Pages135-144
Number of pages10
DOIs
Publication statusPublished - Dec 13 2010
Event15th Australasian Conference on Information Security and Privacy, ACISP 2010 - Sydney, NSW, Australia
Duration: Jul 5 2010Jul 7 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6168 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th Australasian Conference on Information Security and Privacy, ACISP 2010
CountryAustralia
CitySydney, NSW
Period7/5/107/7/10

Fingerprint

Diffie-Hellman
Encryption
Cryptography
Framework

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Zhu, H., Araragi, T., Nishide, T., & Sakurai, K. (2010). Adaptive and composable non-committing encryptions. In Information Security and Privacy - 15th Australasian Conference, ACISP 2010, Proceedings (pp. 135-144). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6168 LNCS). https://doi.org/10.1007/978-3-642-14081-5_9

Adaptive and composable non-committing encryptions. / Zhu, Huafei; Araragi, Tadashi; Nishide, Takashi; Sakurai, Kouichi.

Information Security and Privacy - 15th Australasian Conference, ACISP 2010, Proceedings. 2010. p. 135-144 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6168 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhu, H, Araragi, T, Nishide, T & Sakurai, K 2010, Adaptive and composable non-committing encryptions. in Information Security and Privacy - 15th Australasian Conference, ACISP 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6168 LNCS, pp. 135-144, 15th Australasian Conference on Information Security and Privacy, ACISP 2010, Sydney, NSW, Australia, 7/5/10. https://doi.org/10.1007/978-3-642-14081-5_9
Zhu H, Araragi T, Nishide T, Sakurai K. Adaptive and composable non-committing encryptions. In Information Security and Privacy - 15th Australasian Conference, ACISP 2010, Proceedings. 2010. p. 135-144. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-14081-5_9
Zhu, Huafei ; Araragi, Tadashi ; Nishide, Takashi ; Sakurai, Kouichi. / Adaptive and composable non-committing encryptions. Information Security and Privacy - 15th Australasian Conference, ACISP 2010, Proceedings. 2010. pp. 135-144 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4f3af6fd841b4534b08d41ed27b901dc,
title = "Adaptive and composable non-committing encryptions",
abstract = "In this paper, a new non-committing encryption protocol without failure during the course of a channel setup procedure is constructed and analyzed in the universally composable (UC) framework. We show that the proposed non-committing scheme realizes the UC-security in the presence of adaptive adversary assuming that the decisional Diffie-Hellman problem is hard.",
author = "Huafei Zhu and Tadashi Araragi and Takashi Nishide and Kouichi Sakurai",
year = "2010",
month = "12",
day = "13",
doi = "10.1007/978-3-642-14081-5_9",
language = "English",
isbn = "3642140807",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "135--144",
booktitle = "Information Security and Privacy - 15th Australasian Conference, ACISP 2010, Proceedings",

}

TY - GEN

T1 - Adaptive and composable non-committing encryptions

AU - Zhu, Huafei

AU - Araragi, Tadashi

AU - Nishide, Takashi

AU - Sakurai, Kouichi

PY - 2010/12/13

Y1 - 2010/12/13

N2 - In this paper, a new non-committing encryption protocol without failure during the course of a channel setup procedure is constructed and analyzed in the universally composable (UC) framework. We show that the proposed non-committing scheme realizes the UC-security in the presence of adaptive adversary assuming that the decisional Diffie-Hellman problem is hard.

AB - In this paper, a new non-committing encryption protocol without failure during the course of a channel setup procedure is constructed and analyzed in the universally composable (UC) framework. We show that the proposed non-committing scheme realizes the UC-security in the presence of adaptive adversary assuming that the decisional Diffie-Hellman problem is hard.

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

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

U2 - 10.1007/978-3-642-14081-5_9

DO - 10.1007/978-3-642-14081-5_9

M3 - Conference contribution

AN - SCOPUS:78649889132

SN - 3642140807

SN - 9783642140808

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 135

EP - 144

BT - Information Security and Privacy - 15th Australasian Conference, ACISP 2010, Proceedings

ER -