A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing

Author:

Arfaoui Ghada1,Lalande Jean-François2,Traoré Jacques3,Desmoulins Nicolas3,Berthomé Pascal4,Gharout Saïd5

Affiliation:

1. Orange Labs, F-14066 Caen, INSA Centre Val de Loire, F-18020 Bourges, France

2. INSA Centre Val de Loire - Inria, F-18020 Bourges

3. Orange Labs, F-14066 Caen, France

4. INSA Centre Val de Loire, F-18020 Bourges, France

5. Orange Labs, F-92130 Issy-les-moulineaux, France

Abstract

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 paper1, 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 m-ticketing protocol offers greater flexibility compared to previous solutions as it enables the post-payment and the off-line validation of m-tickets. By implementing a prototype using a standard NFC SIM card, we show that it fulfils the stringent functional requirement imposed by transport operators whilst using strong security parameters. In particular, a validation can be completed in 184.25ms when the mobile is switched on, and in 266.52ms when the mobile is switched off or its battery is flat.

Publisher

Walter de Gruyter GmbH

Subject

General Medicine

Cited by 17 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. SilentProof: Anonymous Authentication with Blockchain-Backed Offloading;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07

2. Efficient Defenses Against Output Poisoning Attacks on Local Differential Privacy;IEEE Transactions on Information Forensics and Security;2023

3. An Efficient Zero-Knowledge Dual Membership Proof Supporting Pos-and-Neg Membership Decision;Mathematics;2022-09-05

4. An Efficient Accountable Oblivious Transfer With Access Control Scheme in the Public Cloud;International Journal of Information Security and Privacy;2022-05-06

5. Pass-As-You-Go: A Direct Anonymous Attestation-Based Untraceable Contactless Transit Pass;Lecture Notes in Computer Science;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3