IEICE TRANSACTIONS on Fundamentals
An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme
Summary :
It is known that composable secure commitments, that is, concurrent non-malleable commitments exist in the plain model, based only on standard assumptions such as the existence of claw-free permutations or even one-way functions. Since being based on the plain model, the deniability of them is trivially satisfied, and especially the latter scheme satisfies also adaptivity, hence it is adaptive-deniable-concurrent non-malleable. However, those schemes cannot be said to be practically efficient. We show a practically efficient (string) adaptive-deniable-concurrent commitment scheme is possible under a global setup model, called the Global CRS-KR model.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.1 pp.367-382
- Publication Date
- 2011/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E94.A.367
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Seiko ARITA, "An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 1, pp. 367-382, January 2011, doi: 10.1587/transfun.E94.A.367.
Abstract: It is known that composable secure commitments, that is, concurrent non-malleable commitments exist in the plain model, based only on standard assumptions such as the existence of claw-free permutations or even one-way functions. Since being based on the plain model, the deniability of them is trivially satisfied, and especially the latter scheme satisfies also adaptivity, hence it is adaptive-deniable-concurrent non-malleable. However, those schemes cannot be said to be practically efficient. We show a practically efficient (string) adaptive-deniable-concurrent commitment scheme is possible under a global setup model, called the Global CRS-KR model.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.367/_p
Copy
@ARTICLE{e94-a_1_367,
author={Seiko ARITA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme},
year={2011},
volume={E94-A},
number={1},
pages={367-382},
abstract={It is known that composable secure commitments, that is, concurrent non-malleable commitments exist in the plain model, based only on standard assumptions such as the existence of claw-free permutations or even one-way functions. Since being based on the plain model, the deniability of them is trivially satisfied, and especially the latter scheme satisfies also adaptivity, hence it is adaptive-deniable-concurrent non-malleable. However, those schemes cannot be said to be practically efficient. We show a practically efficient (string) adaptive-deniable-concurrent commitment scheme is possible under a global setup model, called the Global CRS-KR model.},
keywords={},
doi={10.1587/transfun.E94.A.367},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 367
EP - 382
AU - Seiko ARITA
PY - 2011
DO - 10.1587/transfun.E94.A.367
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2011
AB - It is known that composable secure commitments, that is, concurrent non-malleable commitments exist in the plain model, based only on standard assumptions such as the existence of claw-free permutations or even one-way functions. Since being based on the plain model, the deniability of them is trivially satisfied, and especially the latter scheme satisfies also adaptivity, hence it is adaptive-deniable-concurrent non-malleable. However, those schemes cannot be said to be practically efficient. We show a practically efficient (string) adaptive-deniable-concurrent commitment scheme is possible under a global setup model, called the Global CRS-KR model.
ER -
English
