TY - GEN
T1 - Transferable Optimal-size Fair E-cash with Optimal Anonymity
AU - Zhang, Jiangxiao
AU - Huo, Lina
AU - Liu, Xia
AU - Sui, Chunrong
AU - Li, Zhoujun
AU - Ma, Jinxin
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/10/26
Y1 - 2015/10/26
N2 - Transferable 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. The transferability is a desirable property in many applications. However, in the existing transferable e-cash, the size of coins is constant at the cost of increasing the users' burden and not satisfying the optimal anonymity. On the other hand, the e-cash protocol with optimal anonymity has the drawback that the size of coins grows linearly in the number of transfers. In this paper, a transferable optimal-size e-cash is proposed using a different structure, that is, coins are divided into two parts. The new scheme achieves the optimal anonymity, i.e., it satisfies Observe-then-Receive Full Anonymity (OtR-FA), Spend-then-Observe Full Anonymity (StO-FA) and Spend-then-Receive Full Anonymity (StR-FA). Meanwhile, the users has not to keep in memory the data associated to all past transactions. At last, the security proof of the new scheme is given in the standard model.
AB - Transferable 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. The transferability is a desirable property in many applications. However, in the existing transferable e-cash, the size of coins is constant at the cost of increasing the users' burden and not satisfying the optimal anonymity. On the other hand, the e-cash protocol with optimal anonymity has the drawback that the size of coins grows linearly in the number of transfers. In this paper, a transferable optimal-size e-cash is proposed using a different structure, that is, coins are divided into two parts. The new scheme achieves the optimal anonymity, i.e., it satisfies Observe-then-Receive Full Anonymity (OtR-FA), Spend-then-Observe Full Anonymity (StO-FA) and Spend-then-Receive Full Anonymity (StR-FA). Meanwhile, the users has not to keep in memory the data associated to all past transactions. At last, the security proof of the new scheme is given in the standard model.
KW - Groth-Sahai proofs
KW - group blind signature
KW - optimal anonymity
KW - standard model
KW - transferable e-cash
UR - https://www.scopus.com/pages/publications/84958180942
U2 - 10.1109/TASE.2015.12
DO - 10.1109/TASE.2015.12
M3 - 会议稿件
AN - SCOPUS:84958180942
T3 - Proceedings - 2015 International Symposium on Theoretical Aspects of Software Engineering, TASE 2015
SP - 139
EP - 142
BT - Proceedings - 2015 International Symposium on Theoretical Aspects of Software Engineering, TASE 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - International Symposium on Theoretical Aspects of Software Engineering, TASE 2015
Y2 - 12 September 2015 through 14 September 2015
ER -