A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing
Ghada Arfaoui (LIFO), Jean-Fran\c{c}ois Lalande (INRIA - SUPELEC,, LIFO), Jacques Traor\'e, Nicolas Desmoulins, Pascal Berthom\'e (LIFO), Sa\"id, Gharout

TL;DR
This paper presents a privacy-preserving NFC mobile ticketing protocol that ensures user anonymity, prevents tracking, and is efficient enough for real-world deployment using standard NFC SIM cards.
Contribution
It introduces a practical set-membership proof that avoids costly pairing computations, and optimizes signature schemes for efficient NFC transactions, enhancing privacy and performance.
Findings
Prototype implementation on standard NFC SIM cards
Validation time of 184.25 ms when mobile is on
Validation time of 266.52 ms when mobile is off or battery is flat
Abstract
To ensure the privacy of users in transport systems, researchers are working on new protocols providing the best security guarantees while respecting functional requirements of transport operators. In this paper, we design a secure NFC m-ticketing protocol for public transport that preserves users' anonymity and prevents transport operators from tracing their customers' trips. To this end, we introduce a new practical set-membership proof that does not require provers nor verifiers (but in a specific scenario for verifiers) to perform pairing computations. It is therefore particularly suitable for our (ticketing) setting where provers hold SIM/UICC cards that do not support such costly computations. We also propose several optimizations of Boneh-Boyen type signature schemes, which are of independent interest, increasing their performance and efficiency during NFC transactions. Our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
