Marc Girault

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.

EDBT 2026 Demo / reviewers in the wild / expert

dblp:53/3055 · DBLP profile ↗

← Back

14ranked-venue papers

10as first author

0since 2021 · last 2007

—ORCID · none

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

Security and privacy · 12 · 10 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

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

7 papers

Cryptographic primitives and cryptanalysis · 54% Authentication and access control · 37% Cryptographic protocols and secure computation · 9%

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

Topic	Weight	Papers	Last	Evidence papers
Authentication and access control authentication	0.1	2	2006	On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order · J. Cryptol. 2006 Public Key Authentication with One (Online) Single Addition · CHES 2004
Cryptographic primitives and cryptanalysis › public-key cryptography digital signatures	0.1	2	2006	On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order · J. Cryptol. 2006 Selective Forgery of RSA Signatures Using Redundancy · EUROCRYPT 1997
Cryptographic primitives and cryptanalysis › cryptographic assumptions groups of unknown order	0.1	1	2006	On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order · J. Cryptol. 2006
Authentication and access control › authentication on-the-fly authentication	0.1	1	2006	On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order · J. Cryptol. 2006
Cryptographic protocols and secure computation › secure outsourcing server-aided verification	0.1	1	2005	Server-Aided Verification: Theory and Practice · ASIACRYPT 2005
Cryptographic primitives and cryptanalysis › public-key cryptography elliptic curve cryptography	0.0	1	2004	Public Key Authentication with One (Online) Single Addition · CHES 2004
Authentication and access control › cryptographic authentication public-key authentication	0.0	1	2004	Public Key Authentication with One (Online) Single Addition · CHES 2004
Cryptographic primitives and cryptanalysis public-key cryptography	0.0	1	2004	Public Key Authentication with One (Online) Single Addition · CHES 2004
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography scalar multiplication	0.0	1	2004	Public Key Authentication with One (Online) Single Addition · CHES 2004
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › factorization-based signature RSA signature	0.0	1	1997	Selective Forgery of RSA Signatures Using Redundancy · EUROCRYPT 1997
Cryptographic primitives and cryptanalysis hash functions	0.0	1	1994	On the Length of Cryptographic Hash-Values Used in Identification Schemes · CRYPTO 1994
Authentication and access control › authentication › authentication protocols identification schemes	0.0	1	1994	On the Length of Cryptographic Hash-Values Used in Identification Schemes · CRYPTO 1994

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

groups of unknown order · 0.1single addition · 0.0

Year	Publication	Venue	Position
2007	Lightweight code-based identification and signature abstract We revisit the code-based identification protocol proposed by Stern at Crypto'93, and give evidence that the size of public keys can be dramatically reduced while preserving a high and well-understood level of security. More precisely, the public keys can be made even shorter than RSA ones (typically 347 bits), while their size is around 150 Kbits in the original scheme. This is achieved by using matrices which are double circulant, rather than purely random. On the whole, this provides a very practical identification (and possibly signature) scheme which is mostly attractive for light-weight cryptography. Philippe Gaborit, Marc Girault	ISIT	2
2006	Low-Cost Cryptography for Privacy in RFID Systems Benoît Calmels, Sébastien Canard, Marc Girault, Hervé Sibert	CARDIS	3
2006	Entity authentication schemes using braid word reduction Hervé Sibert, Patrick Dehornoy, Marc Girault	Discret. Appl. Math.	3
2006	On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order Marc Girault, Guillaume Poupard, Jacques Stern	J. Cryptol.	1
2005	Server-Aided Verification: Theory and Practice Marc Girault, David Lefranc	ASIACRYPT	1
2004	Public Key Authentication with One (Online) Single Addition Marc Girault, David Lefranc	CHES	1
2002	Implementing Group Signature Schemes with Smart Cards Sébastien Canard, Marc Girault	CARDIS	2
2000	Low-Size Coupons for Low-Cost IC Cards Marc Girault	CARDIS	1
2000	Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1 Marc Girault, Jean-François Misarsky	EUROCRYPT	1
1998	Relaxing Tamper-Resistance Requirements for Smart Cards by Using (Auto-)Proxy Signatures Marc Girault	CARDIS	1
1997	Selective Forgery of RSA Signatures Using Redundancy Marc Girault, Jean-François Misarsky	EUROCRYPT	1
1994	On the Length of Cryptographic Hash-Values Used in Identification Schemes Marc Girault, Jacques Stern	CRYPTO	1
1990	An Identity-Based Scheme Providing Zero-Knowledge Authentication and Authenticated Key Exchange Marc Girault, Jean Claude Paillès	ESORICS	1
1988	Computation of Approximate L-th Roots Modulo n and Application to Cryptography Marc Girault, Philippe Toffin, Brigitte Vallée	CRYPTO	1