Publications at Orange Innovation

• Compact Issuer-Hiding Authentication, Application to Anonymous Credential (PETS, 2024)

• ICRP: Internet-Friendly Cryptographic Relay-Detection Protocol (Cryptography, 2022)

• Post-Quantum Resistant E-Voting Scheme (VOTING, 2021)

• How Distance-Bounding Can Detect Internet Traffic Hijacking (CANS, 2021)

• EPID with Malicious Revocation (CT-RSA, 2021)

• CoRA: A Scalable Collective Remote Attestation Protocol for Sensor Networks (ICISSP, 2020)

• Improved Secure Integer Comparison via Homomorphic Encryption (CT-RSA, 2020)

• Constant-size Lattice-Based Group Signature with Forward Security in the Standard Model (ProvSec, 2020)

• Practical Anonymous Attestation-based Pseudonym Schemes for Vehicular Networks (VNC, 2019)

• Questioning the security and efficiency of the ESIoT approach (WiSec, 2018)

• Practical Strategy-Resistant Privacy-Preserving Elections (ESORICS, 2018)

• Privacy-Preserving Plaintext-Equality of Low-Entropy Inputs (ACNS, 2018)

• Cut Down the Tree to Achieve Constant Complexity in Divisible E-Cash (PKC, 2017)

• Designing and Proving an EMV-Compliant Payment Protocol for Mobile Devices (EuroS&P, 2017)

• Anonymous attestations made practical (WiSec, 2017)

• Divisible E-Cash Made Practical (IET Information Security, 2016)

• Remote Electronic Voting can be both Efficient and Coercion-Resistant (VOTING, 2016)

• M2M Security: Challenges and Solutions (IEEE Communications Surveys and Tutorials, 2016)

• Cryptanalysis of GlobalPlatform Secure Channel Protocols (SSR, 2016)

• Private eCash in Practice (FC, 2016)

• Improved Algebraic MACs and Practical Keyed-Verification Anonymous Credentials (SAC, 2016)

• Breaking into the KeyStore: A Practical Forgery Attack Against Android KeyStore (ESORICS, 2016)

• Scalable Divisible E-Cash (ACNS, 2015)

• Divisible E-Cash Made Practical (PKC, 2015)

• A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing (PoPETs, 2015)

• Practical and Privacy-Preserving TEE Migration (WISTP, 2015)

• Trusted Execution Environments: A Look under the Hood (MobileCloud, 2014)

• Direct Anonymous Attestation with Dependent Basename opening (CANS, 2014)

• A Practical Coercion Resistant Voting Scheme Revisited (VOTE-ID, 2013)

• New Results for the Practical Use of Range Proofs (EuroPKI, 2013)

• On the Implementation of a Pairing-based Cryptographic Protocol in a Constrained Device (Pairing, 2012)

• Achieving Optimal Anonymity in Transferable E-cash with a Judge (AFRICACRYPT, 2011)

• Multi-show Anonymous Credentials with Encrypted Attributes in the Standard Model (CANS, 2011)

• Fair E-cash: Be Compact, Spend Faster (ISC, 2009)

• Analysis, Improvement, and Simplification of Prêt à Voter with Paillier Encryption. (EVT, 2008)

• Identity federation and privacy: one step beyond. (ACM DIM, 2008)

• Improvement of Efficiency in (Unconditional) Anonymous Transferable E-Cash. (FC, 2008)

• Fair Blind Signatures Revisited. (Pairing, 2007)

• Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use. (ProvSec, 2007)

• Threat Analysis of a Practical Voting Scheme with Receipts. (VOTE-ID, 2007)

• List signature schemes. (Discrete Applied Mathematics, 2006)

• Defeating Malicious Servers in a Blind Signatures Based Voting System. (FC, 2006)

• Universal forgery on Sekhar's signature scheme with message recovery. (Int. J. Comput. Math., 2004)

• Anonymous Services using Smart Cards and Cryptography. (CARDIS, 2004)

• On the Anonymity of Fair Offline E-cash Systems. (FC, 2003)

• On Fair E-cash Systems Based on Group Signature Schemes. (ACISP, 2003)

• A fair and efficient solution to the socialist millionaires' problem. (Discrete Applied Mathematics, 2001)

• An Online Public Auction Protocol Protecting Bidder Privacy. (ACISP, 2000)

• Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery. (ICICS, 1999)