Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jean-Sébastien Coron
dblp:61/1318
· DBLP profile ↗
73ranked-venue papers
61as first author
2since 2021 · last 2025
0000-0003-1021-3344ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 72 · 60 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-authorTheory of computation · 1 · 1 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
56 papers |
Cryptographic primitives and cryptanalysis · 56% Hardware security and side channels · 43% Cryptographic protocols and secure computation · 0% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 30 heaviest of 52, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware security and side channels
side-channel countermeasures |
2.1 | 12 | 2020 | Side-Channel Masking with Pseudo-Random Generator · EUROCRYPT (3) 2020 High-Order Conversion from Boolean to Arithmetic Masking · CHES 2017 Faster Evaluation of SBoxes via Common Shares · CHES 2016 |
Hardware security and side channels › side-channel countermeasures
masking |
1.9 | 9 | 2020 | Side-Channel Masking with Pseudo-Random Generator · EUROCRYPT (3) 2020 High-Order Conversion from Boolean to Arithmetic Masking · CHES 2017 Faster Evaluation of SBoxes via Common Shares · CHES 2016 |
Cryptographic primitives and cryptanalysis › public-key cryptography › algebraic cryptography
multilinear maps |
1.0 | 4 | 2019 | On Kilian's Randomization of Multilinear Map Encodings · ASIACRYPT (2) 2019 Cryptanalysis of GGH15 Multilinear Maps · CRYPTO (2) 2016 New Multilinear Maps Over the Integers · CRYPTO (1) 2015 |
Hardware security and side channels
side-channel attack |
0.9 | 4 | 2020 | Random Probing Security: Verification, Composition, Expansion and New Constructions · CRYPTO (1) 2020 Horizontal Side-Channel Attacks and Countermeasures on the ISW Masking Scheme · CHES 2016 Improved Side-Channel Analysis of Finite-Field Multiplication · CHES 2015 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
bootstrapping |
0.9 | 1 | 2025 | PaCo: Bootstrapping for CKKS via Partial CoeffToSlot · ASIACRYPT (7) 2025 |
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
CKKS |
0.9 | 1 | 2025 | PaCo: Bootstrapping for CKKS via Partial CoeffToSlot · ASIACRYPT (7) 2025 |
Cryptographic primitives and cryptanalysis
homomorphic encryption |
0.9 | 1 | 2025 | PaCo: Bootstrapping for CKKS via Partial CoeffToSlot · ASIACRYPT (7) 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.7 | 8 | 2016 | Practical Cryptanalysis of ISO 9796-2 and EMV Signatures · J. Cryptol. 2016 Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures · CRYPTO 2009 PSS Is Secure against Random Fault Attacks · ASIACRYPT 2009 |
Hardware security and side channels › side-channel countermeasures › masking
probing security |
0.4 | 1 | 2020 | Random Probing Security: Verification, Composition, Expansion and New Constructions · CRYPTO (1) 2020 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption |
0.4 | 3 | 2013 | Batch Fully Homomorphic Encryption over the Integers · EUROCRYPT 2013 Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers · EUROCRYPT 2012 Fully Homomorphic Encryption over the Integers with Shorter Public Keys · CRYPTO 2011 |
Cryptographic primitives and cryptanalysis
public-key cryptography |
0.4 | 3 | 2016 | Practical Cryptanalysis of ISO 9796-2 and EMV Signatures · J. Cryptol. 2016 Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures · CRYPTO 2009 On the Implementation of a Fast Prime Generation Algorithm · CHES 2007 |
Hardware security and side channels › side-channel countermeasures › masking
higher-order masking |
0.3 | 2 | 2014 | Higher Order Masking of Look-Up Tables · EUROCRYPT 2014 Side Channel Cryptanalysis of a Higher Order Masking Scheme · CHES 2007 |
Cryptographic primitives and cryptanalysis
block cipher |
0.2 | 1 | 2016 | How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016 |
Cryptographic primitives and cryptanalysis › block cipher
feistel network |
0.2 | 1 | 2016 | How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016 |
Cryptographic primitives and cryptanalysis › block cipher
ideal cipher |
0.2 | 1 | 2016 | How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016 |
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models
indifferentiability |
0.2 | 1 | 2016 | How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016 |
Hardware security and side channels
fault attacks |
0.2 | 2 | 2009 | Fault Attacks on RSA Signatures with Partially Unknown Messages · CHES 2009 PSS Is Secure against Random Fault Attacks · ASIACRYPT 2009 |
Cryptographic primitives and cryptanalysis
hash functions |
0.2 | 2 | 2010 | Efficient Indifferentiable Hashing into Ordinary Elliptic Curves · CRYPTO 2010 Merkle-Damgård Revisited: How to Construct a Hash Function · CRYPTO 2005 |
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
integer-based FHE |
0.1 | 1 | 2012 | Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers · EUROCRYPT 2012 |
Cryptographic primitives and cryptanalysis › public-key cryptography
RSA |
0.1 | 3 | 2007 | Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring · J. Cryptol. 2007 Universal Padding Schemes for RSA · CRYPTO 2002 On the Security of RSA Padding · CRYPTO 1999 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › factorization-based signature
RSA signature |
0.1 | 2 | 2009 | PSS Is Secure against Random Fault Attacks · ASIACRYPT 2009 Cryptanalysis of RSA Signatures with Fixed-Pattern Padding · CRYPTO 2001 |
Cryptographic primitives and cryptanalysis › cryptographic hardness
knapsack problem |
0.1 | 1 | 2011 | Improved Generic Algorithms for Hard Knapsacks · EUROCRYPT 2011 |
Cryptographic primitives and cryptanalysis
finite field arithmetic |
0.1 | 2 | 2015 | Improved Side-Channel Analysis of Finite-Field Multiplication · CHES 2015 Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures · CHES 2014 |
Cryptographic primitives and cryptanalysis › lattice attack
coppersmith's method |
0.1 | 2 | 2007 | Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach · CRYPTO 2007 Finding Small Roots of Bivariate Integer Polynomial Equations Revisited · EUROCRYPT 2004 |
Cryptographic primitives and cryptanalysis › hash functions
elliptic curve hashing |
0.1 | 1 | 2010 | Efficient Indifferentiable Hashing into Ordinary Elliptic Curves · CRYPTO 2010 |
Hardware security and side channels › side-channel countermeasures
random delay countermeasure |
0.1 | 1 | 2010 | Analysis and Improvement of the Random Delay Countermeasure of CHES 2009 · CHES 2010 |
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption |
0.1 | 3 | 2002 | Universal Padding Schemes for RSA · CRYPTO 2002 From Fixed-Length to Arbitrary-Length RSA Padding Schemes · ASIACRYPT 2000 On the Security of RSA Padding · CRYPTO 1999 |
Cryptographic primitives and cryptanalysis › cryptographic foundations
cryptographic models |
0.1 | 1 | 2008 | The Random Oracle Model and the Ideal Cipher Model Are Equivalent · CRYPTO 2008 |
Cryptographic primitives and cryptanalysis
random oracle model |
0.1 | 1 | 2008 | The Random Oracle Model and the Ideal Cipher Model Are Equivalent · CRYPTO 2008 |
Cryptographic primitives and cryptanalysis › computational number theory
prime number generation |
0.1 | 1 | 2007 | On the Implementation of a Fast Prime Generation Algorithm · CHES 2007 |
Methods — techniques the papers use, named apart from their topics
masking · 1.2pseudorandom generator · 0.4generic algorithms · 0.2cryptanalysis · 0.2threshold implementation · 0.2secret sharing · 0.2fully homomorphic encryption · 0.2public key compression · 0.1modulus switching · 0.1fault attack · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | PaCo: Bootstrapping for CKKS via Partial CoeffToSlot
Jean-Sébastien Coron, Tim Seuré |
ASIACRYPT (7) | 1 |
| 2021 | Secure Wire Shuffling in the Probing Model
Jean-Sébastien Coron, Lorenzo Spignoli |
CRYPTO (3) | 1 |
| 2020 | Random Probing Security: Verification, Composition, Expansion and New Constructions
Sonia Belaïd, Jean-Sébastien Coron, Emmanuel Prouff, Matthieu Rivain, Abdul Rahman Taleb |
CRYPTO (1) | 2 |
| 2020 | A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem
Jean-Sébastien Coron, Agnese Gini |
CRYPTO (2) | 1 |
| 2020 | Side-Channel Masking with Pseudo-Random Generator
Jean-Sébastien Coron, Aurélien Greuet, Rina Zeitoun |
EUROCRYPT (3) | 1 |
| 2019 | Cryptanalysis of CLT13 Multilinear Maps with Independent Slots
Jean-Sébastien Coron, Luca Notarnicola |
ASIACRYPT (2) | 1 |
| 2019 | On Kilian's Randomization of Multilinear Map Encodings
Jean-Sébastien Coron, Hilder Vitor Lima Pereira |
ASIACRYPT (2) | 1 |
| 2018 | Formal Verification of Side-Channel Countermeasures via Elementary Circuit Transformations
Jean-Sébastien Coron |
ACNS | 1 |
| 2018 | Improved Factorization of N=p^rq^s
Jean-Sébastien Coron, Rina Zeitoun |
CT-RSA | 1 |
| 2017 | High-Order Conversion from Boolean to Arithmetic Masking
Jean-Sébastien Coron |
CHES | 1 |
| 2016 | Horizontal Side-Channel Attacks and Countermeasures on the ISW Masking Scheme
Alberto Battistello, Jean-Sébastien Coron, Emmanuel Prouff, Rina Zeitoun |
CHES | 2 |
| 2016 | Faster Evaluation of SBoxes via Common Shares
Jean-Sébastien Coron, Aurélien Greuet, Emmanuel Prouff, Rina Zeitoun |
CHES | 1 |
| 2016 | Cryptanalysis of GGH15 Multilinear Maps
Jean-Sébastien Coron, Moon Sung Lee, Tancrède Lepoint, Mehdi Tibouchi |
CRYPTO (2) | 1 |
| 2016 | Factoring N=p^rq^s for Large r and s
Jean-Sébastien Coron, Jean-Charles Faugère, Guénaël Renault, Rina Zeitoun |
CT-RSA | 1 |
| 2016 | How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction
Jean-Sébastien Coron, Thomas Holenstein, Robin Künzler, Jacques Patarin, Yannick Seurin, Stefano Tessaro |
J. Cryptol. | 1 |
| 2016 | Practical Cryptanalysis of ISO 9796-2 and EMV Signatures
Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi, Ralf-Philipp Weinmann |
J. Cryptol. | 1 |
| 2015 | Improved Side-Channel Analysis of Finite-Field Multiplication
Sonia Belaïd, Jean-Sébastien Coron, Pierre-Alain Fouque, Benoît Gérard, Jean-Gabriel Kammerer, Emmanuel Prouff |
CHES | 2 |
| 2015 | Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Jean-Sébastien Coron, Craig Gentry, Shai Halevi, Tancrède Lepoint, Hemanta K. Maji, Eric Miles, Mariana Raykova 0001, Amit Sahai, Mehdi Tibouchi |
CRYPTO (1) | 1 |
| 2015 | New Multilinear Maps Over the Integers
Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi |
CRYPTO (1) | 1 |
| 2015 | Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity
Jean-Sébastien Coron, Johann Großschädl, Mehdi Tibouchi, Praveen Kumar Vadnala |
FSE | 1 |
| 2014 | Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures
Jean-Sébastien Coron, Arnab Roy 0005, Srinivas Vivek 0001 |
CHES | 1 |
| 2014 | Secure Conversion between Boolean and Arithmetic Masking of Any Order
Jean-Sébastien Coron, Johann Großschädl, Praveen Kumar Vadnala |
CHES | 1 |
| 2014 | Higher Order Masking of Look-Up Tables
Jean-Sébastien Coron |
EUROCRYPT | 1 |
| 2013 | Practical Multilinear Maps over the Integers
Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi |
CRYPTO (1) | 1 |
| 2013 | Batch Fully Homomorphic Encryption over the Integers
Jung Hee Cheon, Jean-Sébastien Coron, Moon Sung Lee, Tancrède Lepoint, Mehdi Tibouchi, Aaram Yun |
EUROCRYPT | 2 |
| 2013 | Higher-Order Side Channel Security and Mask Refreshing
Jean-Sébastien Coron, Emmanuel Prouff, Matthieu Rivain, Thomas Roche |
FSE | 1 |
| 2013 | A Note on the Bivariate Coppersmith Theorem
Jean-Sébastien Coron, Alexey Kirichenko, Mehdi Tibouchi |
J. Cryptol. | 1 |
| 2012 | On the Use of Shamir's Secret Sharing against Side-Channel Analysis
Jean-Sébastien Coron, Emmanuel Prouff, Thomas Roche |
CARDIS | 1 |
| 2012 | Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi |
EUROCRYPT | 1 |
| 2011 | Fully Homomorphic Encryption over the Integers with Shorter Public Keys
Jean-Sébastien Coron, Avradip Mandal, David Naccache, Mehdi Tibouchi |
CRYPTO | 1 |
| 2011 | Improved Generic Algorithms for Hard Knapsacks
Anja Becker 0001, Jean-Sébastien Coron, Antoine Joux |
EUROCRYPT | 2 |
| 2010 | On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption
Aurélie Bauer, Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi, Damien Vergnaud |
ACNS | 2 |
| 2010 | Secure Delegation of Elliptic-Curve Pairing
Benoît Chevallier-Mames, Jean-Sébastien Coron, Noel McCullagh, David Naccache, Michael Scott |
CARDIS | 2 |
| 2010 | Analysis and Improvement of the Random Delay Countermeasure of CHES 2009
Jean-Sébastien Coron, Ilya Kizhvatov |
CHES | 1 |
| 2010 | Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
Eric Brier, Jean-Sébastien Coron, Thomas Icart, David Madore, Hugues Randriambololona, Mehdi Tibouchi |
CRYPTO | 2 |
| 2010 | Fault Attacks Against emv Signatures
Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi |
CT-RSA | 1 |
| 2010 | Fault Attacks and Countermeasures on Vigilant's RSA-CRT AlgorithmabstractAt CHES 2008, Vigilant proposed an efficient way of implementing a CRT-RSA resistant against Fault Analysis. In this paper, we investigate the fault-resistance of this scheme and we show that it is not immune to fault injection. Indeed, we highlight two weaknesses which can lead an attacker to recover the whole private key by using only one faulty signature. We also suggest some modifications with a negligible cost to improve the fault-resistance of Vigilant's scheme. Therefore the scheme including modifications remains suited to embedded device constraints. Jean-Sébastien Coron, Christophe Giraud 0001, Nicolas Morin, Gilles Piret, David Vigilant |
FDTC | 1 |
| 2010 | A Domain Extender for the Ideal Cipher
Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin |
TCC | 1 |
| 2009 | PSS Is Secure against Random Fault Attacks
Jean-Sébastien Coron, Avradip Mandal |
ASIACRYPT | 1 |
| 2009 | Fault Attacks on RSA Signatures with Partially Unknown Messages
Jean-Sébastien Coron, Antoine Joux, Ilya Kizhvatov, David Naccache, Pascal Paillier |
CHES | 1 |
| 2009 | An Efficient Method for Random Delay Generation in Embedded Software
Jean-Sébastien Coron, Ilya Kizhvatov |
CHES | 1 |
| 2009 | Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures
Jean-Sébastien Coron, David Naccache, Mehdi Tibouchi, Ralf-Philipp Weinmann |
CRYPTO | 1 |
| 2009 | A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
Jean-Sébastien Coron |
Des. Codes Cryptogr. | 1 |
| 2008 | Attack and Improvement of a Secure S-Box Calculation Based on the Fourier Transform
Jean-Sébastien Coron, Christophe Giraud 0001, Emmanuel Prouff, Matthieu Rivain |
CHES | 1 |
| 2008 | The Random Oracle Model and the Ideal Cipher Model Are Equivalent
Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin |
CRYPTO | 1 |
| 2008 | Cryptanalysis of ISO/IEC 9796-1
Don Coppersmith, Jean-Sébastien Coron, François Grieu, Shai Halevi, Charanjit S. Jutla, David Naccache, Julien P. Stern |
J. Cryptol. | 2 |
| 2007 | On the Implementation of a Fast Prime Generation Algorithm
Christophe Clavier, Jean-Sébastien Coron |
CHES | 2 |
| 2007 | Side Channel Cryptanalysis of a Higher Order Masking Scheme
Jean-Sébastien Coron, Emmanuel Prouff, Matthieu Rivain |
CHES | 1 |
| 2007 | Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
Jean-Sébastien Coron |
CRYPTO | 1 |
| 2007 | Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
Jean-Sébastien Coron, Alexander May 0001 |
J. Cryptol. | 1 |
| 2006 | Index Calculation Attacks on RSA Signature and Encryption
Jean-Sébastien Coron, David Naccache, Yvo Desmedt, Andrew M. Odlyzko, Julien P. Stern |
Des. Codes Cryptogr. | 1 |
| 2005 | A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis
Jean-Sébastien Coron, David Lefranc, Guillaume Poupard |
CHES | 1 |
| 2005 | Merkle-Damgård Revisited: How to Construct a Hash Function
Jean-Sébastien Coron, Yevgeniy Dodis, Cécile Malinaud, Prashant Puniya |
CRYPTO | 1 |
| 2004 | Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt '95
Jean-Sébastien Coron, David Naccache |
CT-RSA | 1 |
| 2004 | Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
Jean-Sébastien Coron |
EUROCRYPT | 1 |
| 2004 | Statistics and secret leakageabstractIn addition to its usual complexity assumptions, cryptography silently assumes that information can be physically protected in a single location. As one can easily imagine, real-life devices are not ideal and information may leak through different physical channels.This paper gives a rigorous definition of leakage immunity and presents several leakage detection tests. In these tests, failure confirms the probable existence of secret-correlated emanations and indicates how likely the leakage is. Success does not refute the existence of emanations but indicates that significant emanations were not detected on the strength of the evidence presented , which of course, leaves the door open to reconsider the situation if further evidence comes to hand at a later date. Jean-Sébastien Coron, David Naccache, Paul C. Kocher |
ACM Trans. Embed. Comput. Syst. | 1 |
| 2003 | Boneh et al.'s k-Element Aggregate Extraction Assumption Is Equivalent to the Diffie-Hellman Assumption
Jean-Sébastien Coron, David Naccache |
ASIACRYPT | 1 |
| 2003 | A New Algorithm for Switching from Arithmetic to Boolean Masking
Jean-Sébastien Coron, Alexei Tchulkine |
CHES | 1 |
| 2002 | Security Proof for Partial-Domain Hash Signature Schemes
Jean-Sébastien Coron |
CRYPTO | 1 |
| 2002 | Universal Padding Schemes for RSA
Jean-Sébastien Coron, Marc Joye, David Naccache, Pascal Paillier |
CRYPTO | 1 |
| 2002 | GEM: A Generic Chosen-Ciphertext Secure Encryption Method
Jean-Sébastien Coron, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen |
CT-RSA | 1 |
| 2002 | Optimal Security Proofs for PSS and Other Signature Schemes
Jean-Sébastien Coron |
EUROCRYPT | 1 |
| 2001 | Cryptanalysis of RSA Signatures with Fixed-Pattern Padding
Eric Brier, Christophe Clavier, Jean-Sébastien Coron, David Naccache |
CRYPTO | 3 |
| 2000 | From Fixed-Length to Arbitrary-Length RSA Padding Schemes
Jean-Sébastien Coron, François Koeune, David Naccache |
ASIACRYPT | 1 |
| 2000 | Differential Power Analysis in the Presence of Hardware Countermeasures
Christophe Clavier, Jean-Sébastien Coron, Nora Dabbous |
CHES | 2 |
| 2000 | On Boolean and Arithmetic Masking against Differential Power Analysis
Jean-Sébastien Coron, Louis Goubin |
CHES | 1 |
| 2000 | On the Exact Security of Full Domain Hash
Jean-Sébastien Coron |
CRYPTO | 1 |
| 2000 | New Attacks on PKCS#1 v1.5 Encryption
Jean-Sébastien Coron, Marc Joye, David Naccache, Pascal Paillier |
EUROCRYPT | 1 |
| 2000 | Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme
Jean-Sébastien Coron, David Naccache |
EUROCRYPT | 1 |
| 1999 | ECC: Do We Need to Count?
Jean-Sébastien Coron, Helena Handschuh, David Naccache |
ASIACRYPT | 1 |
| 1999 | Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems
Jean-Sébastien Coron |
CHES | 1 |
| 1999 | On the Security of RSA Padding
Jean-Sébastien Coron, David Naccache, Julien P. Stern |
CRYPTO | 1 |
| 1998 | An Accurate Evaluation of Maurer's Universal Test
Jean-Sébastien Coron, David Naccache |
Selected Areas in Cryptography | 1 |