ADAPTIVE AND COMPOSABLE NON-INTERACTIVE STRING-COMMITMENT PROTOCOLS

Huafei Zhu; Tadashi Araragi; Takashi Nishide; Kouichi Sakurai

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

ADAPTIVE AND COMPOSABLE NON-INTERACTIVE STRING-COMMITMENT PROTOCOLS

Topics: Public Key Crypto Applications

In Proceedings of the International Conference on Security and Cryptography - Volume 0ICETE, 354-361, 2010 , University of Piraeus, Greece

Authors: Huafei Zhu ¹ ; Tadashi Araragi ² ; Takashi Nishide ³ and Kouichi Sakurai ³

Affiliations: ¹ A-STAR, Singapore ; ² NTT Communication Science Laboratories, Japan ; ³ Kyushu University, Japan

Keyword(s): Non-interactive, String-commitment protocol, Universally composable security.

Related Ontology Subjects/Areas/Topics: Cryptographic Techniques and Key Management ; Information and Systems Security ; Public Key Crypto Applications

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.144.252.153

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Zhu, H.; Araragi, T.; Nishide, T. and Sakurai, K. (2010). ADAPTIVE AND COMPOSABLE NON-INTERACTIVE STRING-COMMITMENT PROTOCOLS. In Proceedings of the International Conference on Security and Cryptography (ICETE 2010) - SECRYPT; ISBN 978-989-8425-18-8; ISSN 2184-3236, SciTePress, pages 354-361. DOI: 10.5220/0002980503540361

@conference{secrypt10,
author={Huafei Zhu. and Tadashi Araragi. and Takashi Nishide. and Kouichi Sakurai.},
title={ADAPTIVE AND COMPOSABLE NON-INTERACTIVE STRING-COMMITMENT PROTOCOLS},
booktitle={Proceedings of the International Conference on Security and Cryptography (ICETE 2010) - SECRYPT},
year={2010},
pages={354-361},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002980503540361},
isbn={978-989-8425-18-8},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the International Conference on Security and Cryptography (ICETE 2010) - SECRYPT
TI - ADAPTIVE AND COMPOSABLE NON-INTERACTIVE STRING-COMMITMENT PROTOCOLS
SN - 978-989-8425-18-8
IS - 2184-3236
AU - Zhu, H.
AU - Araragi, T.
AU - Nishide, T.
AU - Sakurai, K.
PY - 2010
SP - 354
EP - 361
DO - 10.5220/0002980503540361
PB - SciTePress