Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nicolas Desmoulins

dblp:125/2927 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › secure query processing
encrypted matching
0.312018
Pattern Matching on Encrypted Streams · ASIACRYPT (1) 2018

Methods — techniques the papers use, named apart from their topics

secure computation · 0.3
YearPublicationVenuePosition
2018 Pattern Matching on Encrypted Streams
Nicolas Desmoulins, Pierre-Alain Fouque, Cristina Onete, Olivier Sanders
ASIACRYPT (1)1
2017 Anonymous attestations made practical
abstract
Direct Anonymous Attestation (DAA) is a privacy preserving authentication protocol initially designed for Trusted Platform Modules (TPMs). This cryptographic protocol, and some of its extensions such as Intel's Enhanced Privacy ID (EPID), have been widely deployed in millions of chips. Usually part of the attestation computation is delegated to the host (in most cases, either a PC or a smartphone) embedding the TPM, which is generally much more powerful. However, in Machine-to-Machine (M2M) and Internet of Things (IoT) use cases, the host may be as resource constrained as the TPM. Furthermore, any malware residing in the host may enable the tracking of the TPM owner.
Amira Barki, Nicolas Desmoulins, Said Gharout, Jacques Traoré
WISEC2
2016 Improved Algebraic MACs and Practical Keyed-Verification Anonymous Credentials
Amira Barki, Solenn Brunet, Nicolas Desmoulins, Jacques Traoré
SAC3
2015 A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing
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.
Ghada Arfaoui, Jean-François Lalande, Jacques Traoré, Nicolas Desmoulins, Pascal Berthomé, Said Gharout
Proc. Priv. Enhancing Technol.4
2014 Direct Anonymous Attestations with Dependent Basename Opening
Nicolas Desmoulins, Roch Lescuyer, Olivier Sanders, Jacques Traoré
CANS1
2012 On the Implementation of a Pairing-Based Cryptographic Protocol in a Constrained Device
Sébastien Canard, Nicolas Desmoulins, Julien Devigne, Jacques Traoré
Pairing2