IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Regular Section
An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme
Seiko ARITA
著者情報
ジャーナル 認証あり

2011 年 E94.A 巻 1 号 p. 367-382

詳細
抄録

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.

著者関連情報
© 2011 The Institute of Electronics, Information and Communication Engineers
前の記事 次の記事
feedback
Top