Accessibility navigation


A trustworthy and untraceable centralised payment protocol for mobile payment

Neera, J., Chen, X. ORCID: https://orcid.org/0000-0001-9267-355X, Aslam, N. and Issac, B. (2024) A trustworthy and untraceable centralised payment protocol for mobile payment. ACM Transactions on Privacy and Security. ISSN 2471-2574

[img] Text - Accepted Version
· Restricted to Repository staff only
· The Copyright of this document has not been checked yet. This may affect its availability.

875kB

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1145/3706421

Abstract/Summary

Current mobile payment schemes gather detailed information about purchases customers make. This data can then be used to infer a customer’s spending behaviour, potentially violating their privacy. To tackle this problem, we propose an untraceable mobile payment scheme that strikes a better balance, preserving user privacy while allowing the Third-Party Service Provider (TPSP) to collect necessary information such as card details and transaction amount for regulatory compliance. Our scheme offers untraceability for legitimate users from malicious adversaries and curious TPSPs using cryptographic primitives such as partially blind signatures, zero-knowledge proofs and identity-based signatures. It also guarantees that only authorised TPSPs can issue valid payment tokens, and even with limited data the TPSP can still prevent dishonest customers/merchants from double-spending a payment token. We also propose a comprehensive evaluation framework to assess the untraceable payment schemes against seven key criteria such as untraceability, exculpability - merchant double-spending, exculpability - customer double-spending, unforgeability, confidentiality, message authenticity, efficiency and regulatory compliance. We rigorously benchmark the security and privacy of our proposed payment scheme against this framework and other established schemes. Furthermore, we formally verify these properties using complexity-based analysis and Proverif modelling.

Item Type:Article
Refereed:Yes
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:119815
Publisher:ACM

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation