Universally Composable NBAC-Based Fair Voucher Exchange for Mobile Environments

Kazuki YONEYAMA; Masayuki TERADA; Sadayuki HONGO; Kazuo OHTA

doi:10.1587/transfun.E94.A.1263

Universally Composable NBAC-Based Fair Voucher Exchange for Mobile Environments

Kazuki YONEYAMA, Masayuki TERADA, Sadayuki HONGO, Kazuo OHTA

Full Text Views

0

Cite this

Summary :

Fair exchange is an important tool to achieve “fairness” of electronic commerce. Several previous schemes satisfy universally composable security which provides security preserving property under complex networks like the Internet. In recent years, as the demand for electronic commerce increases, fair exchange for electronic vouchers (e.g., electronic tickets, moneys, etc.) to obtain services or contents is in the spotlight. The definition of fairness for electronic vouchers is different from that for general electronic items (e.g., the sender must not do duplicate use of exchanged electronic vouchers). However, although there are universally composable schemes for electronic items, there is no previous study for electronic vouchers. In this paper, we introduce a universally composable definition of fair voucher exchange, that is, an ideal functionality of fair voucher exchange. Also, we prove the equivalence between our universally composable definition and the conventional definition for electronic vouchers. Thus, our formulation of the ideal functionality is justified. Finally, we propose a new fair voucher exchange scheme from non-blocking atomic commitment as black-box, which satisfies our security definition and is adequate for mobile environments. By instantiating general building blocks with known practical ones, our scheme can be also practical because it is implemented without trusted third party in usual executions.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.6 pp.1263-1273

Publication Date: 2011/06/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E94.A.1263

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category

Cite this

Copy

Kazuki YONEYAMA, Masayuki TERADA, Sadayuki HONGO, Kazuo OHTA, "Universally Composable NBAC-Based Fair Voucher Exchange for Mobile Environments" in IEICE TRANSACTIONS on Fundamentals, vol. E94-A, no. 6, pp. 1263-1273, June 2011, doi: 10.1587/transfun.E94.A.1263.
Abstract: Fair exchange is an important tool to achieve “fairness” of electronic commerce. Several previous schemes satisfy universally composable security which provides security preserving property under complex networks like the Internet. In recent years, as the demand for electronic commerce increases, fair exchange for electronic vouchers (e.g., electronic tickets, moneys, etc.) to obtain services or contents is in the spotlight. The definition of fairness for electronic vouchers is different from that for general electronic items (e.g., the sender must not do duplicate use of exchanged electronic vouchers). However, although there are universally composable schemes for electronic items, there is no previous study for electronic vouchers. In this paper, we introduce a universally composable definition of fair voucher exchange, that is, an ideal functionality of fair voucher exchange. Also, we prove the equivalence between our universally composable definition and the conventional definition for electronic vouchers. Thus, our formulation of the ideal functionality is justified. Finally, we propose a new fair voucher exchange scheme from non-blocking atomic commitment as black-box, which satisfies our security definition and is adequate for mobile environments. By instantiating general building blocks with known practical ones, our scheme can be also practical because it is implemented without trusted third party in usual executions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.1263/_p

Copy

@ARTICLE{e94-a_6_1263,
author={Kazuki YONEYAMA, Masayuki TERADA, Sadayuki HONGO, Kazuo OHTA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Universally Composable NBAC-Based Fair Voucher Exchange for Mobile Environments},
year={2011},
volume={E94-A},
number={6},
pages={1263-1273},
abstract={Fair exchange is an important tool to achieve “fairness” of electronic commerce. Several previous schemes satisfy universally composable security which provides security preserving property under complex networks like the Internet. In recent years, as the demand for electronic commerce increases, fair exchange for electronic vouchers (e.g., electronic tickets, moneys, etc.) to obtain services or contents is in the spotlight. The definition of fairness for electronic vouchers is different from that for general electronic items (e.g., the sender must not do duplicate use of exchanged electronic vouchers). However, although there are universally composable schemes for electronic items, there is no previous study for electronic vouchers. In this paper, we introduce a universally composable definition of fair voucher exchange, that is, an ideal functionality of fair voucher exchange. Also, we prove the equivalence between our universally composable definition and the conventional definition for electronic vouchers. Thus, our formulation of the ideal functionality is justified. Finally, we propose a new fair voucher exchange scheme from non-blocking atomic commitment as black-box, which satisfies our security definition and is adequate for mobile environments. By instantiating general building blocks with known practical ones, our scheme can be also practical because it is implemented without trusted third party in usual executions.},
keywords={},
doi={10.1587/transfun.E94.A.1263},
ISSN={1745-1337},
month={June},}

Copy

TY - JOUR
TI - Universally Composable NBAC-Based Fair Voucher Exchange for Mobile Environments
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1263
EP - 1273
AU - Kazuki YONEYAMA
AU - Masayuki TERADA
AU - Sadayuki HONGO
AU - Kazuo OHTA
PY - 2011
DO - 10.1587/transfun.E94.A.1263
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2011
AB - Fair exchange is an important tool to achieve “fairness” of electronic commerce. Several previous schemes satisfy universally composable security which provides security preserving property under complex networks like the Internet. In recent years, as the demand for electronic commerce increases, fair exchange for electronic vouchers (e.g., electronic tickets, moneys, etc.) to obtain services or contents is in the spotlight. The definition of fairness for electronic vouchers is different from that for general electronic items (e.g., the sender must not do duplicate use of exchanged electronic vouchers). However, although there are universally composable schemes for electronic items, there is no previous study for electronic vouchers. In this paper, we introduce a universally composable definition of fair voucher exchange, that is, an ideal functionality of fair voucher exchange. Also, we prove the equivalence between our universally composable definition and the conventional definition for electronic vouchers. Thus, our formulation of the ideal functionality is justified. Finally, we propose a new fair voucher exchange scheme from non-blocking atomic commitment as black-box, which satisfies our security definition and is adequate for mobile environments. By instantiating general building blocks with known practical ones, our scheme can be also practical because it is implemented without trusted third party in usual executions.
ER -