A fair offline electronic cash scheme with multiple-bank in standard model

Abstract

ABSTRACTOffline electronic cash is a new and well-acknowledged type of e-cash scheme that can release the bank from participating in every spending protocol. However, it is still an unsolved problem to design a secure and efficient fair offline e-cash scheme. Considering this problem, in this paper, we have proposed a fair offline electronic cash scheme with multiple banks in pairing-based instantiation. We adopt Groth–Sahai non-interactive zero-knowledge proof technology in our scheme, to design non-interactive e-cash transactions. Additionally, inspired by Water’s group signature, our solution supports not only multiple users, but also users with accounts in different banks. Moreover, our scheme has efficient double-spending checking and a fair control mechanism. We have formally defined the security properties of the scheme in a standard model, and provided the detailed security proofs of the security properties concerning chosen ciphertext attack (CCA) anonymity, unforgeability and traceability. Analysis and comparison show that our scheme has advantages both in security and in efficiency.