Open AccessTransferable conditional e‐cash with optimal anonymity in the standard model
Author(s) -
Zhang Jiangxiao,
Guo Hua,
Li Zhoujun,
Xu Chang
Publication year - 2015
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2013.0138
Subject(s) - anonymity , transferable utility , database transaction , computer science , mathematics , computer security , mathematical economics , game theory , programming language
Transferable conditional electronic‐cash (e‐cash) allows the recipient of a coin in a transaction to transfer it in a later payment transaction to the third person based on the outcome not known in advance. Anonymity is a very important property for a transferable conditional e‐cash. However, none of the existed transferable conditional e‐cash achieve the optimal anonymity because of its special structure, that is, introducing transferability in the conditional e‐cash. In this study, they novelly present a transferable conditional e‐cash scheme using a totally different structure, that is, adding condition into the transferable e‐cash. Thanks to employing Groth–Sahai proofs systems and commuting signatures, the new transferable conditional e‐cash satisfies optimal anonymity. Accordingly, they present an extended security model by introducing a publisher who is responsible for publishing two outcomes of a condition. Then, they prove the new scheme's security in the standard model. Compared with the existing transferable conditional e‐cash, the efficiency of the new scheme is also improved since the size of the computation and communication is constant.