Demo Data from EDBT 2026 / reviewers in the wild / expert
Aline Gouget
dblp:77/2379
· DBLP profile ↗
11ranked-venue papers
3as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 11 · 3 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
3 papers |
Cryptographic primitives and cryptanalysis · 49% Blockchain and cryptocurrency security · 34% Privacy and data protection · 17% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
anonymity |
0.1 | 1 | 2007 | Divisible E-Cash Systems Can Be Truly Anonymous · EUROCRYPT 2007 |
Blockchain and cryptocurrency security › electronic cash
divisible e-cash |
0.1 | 1 | 2007 | Divisible E-Cash Systems Can Be Truly Anonymous · EUROCRYPT 2007 |
Blockchain and cryptocurrency security
electronic cash |
0.1 | 1 | 2007 | Divisible E-Cash Systems Can Be Truly Anonymous · EUROCRYPT 2007 |
Cryptographic primitives and cryptanalysis
pseudorandom generators |
0.1 | 1 | 2006 | How to Strengthen Pseudo-random Generators by Using Compression · EUROCRYPT 2006 |
Cryptographic primitives and cryptanalysis › boolean functions
algebraic immunity |
0.0 | 1 | 2002 | An Upper Bound on the Number of m-Resilient Boolean Functions · ASIACRYPT 2002 |
Cryptographic primitives and cryptanalysis
boolean functions |
0.0 | 1 | 2002 | An Upper Bound on the Number of m-Resilient Boolean Functions · ASIACRYPT 2002 |
Cryptographic primitives and cryptanalysis › boolean functions
resilient functions |
0.0 | 1 | 2002 | An Upper Bound on the Number of m-Resilient Boolean Functions · ASIACRYPT 2002 |
Cryptographic primitives and cryptanalysis
symmetric cryptography |
0.0 | 1 | 2002 | An Upper Bound on the Number of m-Resilient Boolean Functions · ASIACRYPT 2002 |
Methods — techniques the papers use, named apart from their topics
compression · 0.1combinatorial counting · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Plaintext-Checkable Encryption
Sébastien Canard, Georg Fuchsbauer, Aline Gouget, Fabien Laguillaumie |
CT-RSA | 3 |
| 2012 | Formal Verification of the mERA-Based eServices with Trusted Third Party Protocol
Maria Christofi, Aline Gouget |
SEC | 2 |
| 2009 | Fair E-Cash: Be Compact, Spend Faster
Sébastien Canard, Cécile Delerablée, Aline Gouget, Emeline Hufschmitt, Fabien Laguillaumie, Hervé Sibert, Jacques Traoré, Damien Vergnaud |
ISC | 3 |
| 2008 | Anonymity in Transferable E-cash
Sébastien Canard, Aline Gouget |
ACNS | 2 |
| 2008 | Recent Advances in Electronic Cash Design
Aline Gouget |
CARDIS | 1 |
| 2008 | How to Use Merkle-Damgård - On the Security Relations between Signature Schemes and Their Inner Hash Functions
Emmanuel Bresson, Benoît Chevallier-Mames, Christophe Clavier, Aline Gouget, Pascal Paillier, Thomas Peyrin |
ProvSec | 4 |
| 2007 | Divisible E-Cash Systems Can Be Truly Anonymous
Sébastien Canard, Aline Gouget |
EUROCRYPT | 2 |
| 2006 | A Handy Multi-coupon System
Sébastien Canard, Aline Gouget, Emeline Hufschmitt |
ACNS | 2 |
| 2006 | How to Strengthen Pseudo-random Generators by Using Compression
Aline Gouget, Hervé Sibert |
EUROCRYPT | 1 |
| 2005 | Analysis of the Bit-Search Generator and Sequence Compression Techniques
Aline Gouget, Hervé Sibert, Côme Berbain, Nicolas T. Courtois, Blandine Debraize, Chris J. Mitchell |
FSE | 1 |
| 2002 | An Upper Bound on the Number of m-Resilient Boolean Functions
Claude Carlet, Aline Gouget |
ASIACRYPT | 2 |