Jacques Stern
#19,378
Most Influential Person Now
French cryptographer
Jacques Stern's AcademicInfluence.com Rankings
Jacques Sternmathematics Degrees
Mathematics
#2052
World Rank
#3227
Historical Rank
Measure Theory
#1899
World Rank
#2314
Historical Rank
Download Badge
Computer Science Mathematics
Jacques Stern's Degrees
- PhD Mathematics Université Paris Cité
Why Is Jacques Stern Influential?
(Suggest an Edit or Addition)According to Wikipedia, Jacques Stern is a cryptographer, currently a professor at the École Normale Supérieure. He received the 2006 CNRS Gold medal. His notable work includes the cryptanalysis of numerous encryption and signature schemes, the design of the Pointcheval–Stern signature algorithm, the Naccache–Stern cryptosystem and Naccache–Stern knapsack cryptosystem, and the block ciphers CS-Cipher, DFC, and xmx. He also contributed to the cryptanalysis of the SFLASH signature scheme.
Jacques Stern's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Security Arguments for Digital Signatures and Blind Signatures (2015) (1138)
- Security Proofs for Signature Schemes (1996) (1114)
- Advances in Cryptology — EUROCRYPT ’99 (1999) (814)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (1993) (484)
- A method for finding codewords of small weight (1989) (470)
- RSA-OAEP Is Secure under the RSA Assumption (2001) (420)
- A new public key cryptosystem based on higher residues (1998) (366)
- A New Identification Scheme Based on Syndrome Decoding (1993) (365)
- Sharing Decryption in the Context of Voting or Lotteries (2000) (335)
- Practical multi-candidate election system (2001) (327)
- Threshold Ring Signatures and Applications to Ad-hoc Groups (2002) (306)
- Provably Secure Blind Signature Schemes (1996) (268)
- Improved low-density subset sum algorithms (1992) (211)
- Efficient Revocation in Group Signatures (2001) (176)
- Lattice Reduction: A Toolbox for the Cryptanalyst (1998) (172)
- A new paradigm for public key identification (1996) (168)
- Practical Cryptanalysis of SFLASH (2007) (158)
- A New Public-Key Cryptosystem (1997) (142)
- Lattice Reduction in Cryptology: An Update (2000) (136)
- Security Analysis of a Practical "on the fly" Authentication and Signature Generation (1998) (135)
- Flaws in Applying Proof Methodologies to Signature Schemes (2002) (124)
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding (1996) (114)
- On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order (2006) (106)
- Differential Cryptanalysis for Multivariate Schemes (2005) (105)
- Complexity of Some Problems from the Theory of Automata (1985) (98)
- Non-interactive Private Auctions (2002) (92)
- Secret linear congruential generators are not cryptographically secure (1987) (91)
- Cryptanalysis of the Ajtai-Dwork Cryptosystem (1998) (90)
- Designing Identification Schemes with Keys of Short Size (1994) (89)
- Attacks on the Birational Permutation Signature Schemes (1993) (88)
- Distribution of Modular Sums and the Security of the Server Aided Exponentiation (2001) (82)
- Inverting HFE Is Quasipolynomial (2006) (78)
- Fully Distributed Threshold RSA under Standard Assumptions (2001) (76)
- Extended Notions of Security for Multicast Public Key Cryptosystems (2000) (76)
- The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes (1996) (72)
- Merkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations (1997) (66)
- Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001 (2001) (65)
- Projective Coordinates Leak (2004) (64)
- Fair Encryption of RSA Keys (2000) (63)
- Probing Attacks on Tamper-Resistant Devices (1999) (61)
- On the Length of Cryptographic Hash-Values Used in Identification Schemes (1994) (61)
- Adapting Density Attacks to Low-Weight Knapsacks (2005) (60)
- CryptoComputing with Rationals (2002) (59)
- Characterizations of Some Classes of Regular Events (1985) (56)
- Generation of Shared RSA Keys by Two Parties (1998) (53)
- Signing on a Postcard (2000) (53)
- Ultrapowers and local properties of Banach spaces (1978) (52)
- The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications (1999) (51)
- Cryptanalysis of SFLASH with Slightly Modified Parameters (2007) (50)
- One Round Threshold Discrete-Log Key Generation without Private Channels (2001) (49)
- On the fly signatures based on factoring (1999) (49)
- Linear Cryptanalysis of Non Binary Ciphers (2007) (48)
- Why Provable Security Matters? (2003) (48)
- New blind signatures equivalent to factorization (extended abstract) (1997) (47)
- The strength of measurability hypotheses (1985) (46)
- BPS : a Format-Preserving Encryption Proposal (2010) (46)
- On Lusin's restricted continuum problem (1984) (45)
- The security of the birational permutation signature schemes (1997) (42)
- Twin signatures: an alternative to the hash-and-sign paradigm (2001) (41)
- Short Proofs of Knowledge for Factoring (2000) (40)
- The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure (1998) (39)
- Some applications of model theory in Banach space theory (1976) (37)
- Decorrelated Fast Cipher: an AES Candidate (1998) (36)
- Proofs of Knowledge for Non-monotone Discrete-Log Formulae and Applications (2002) (35)
- New Blind Signatures Equivalent to Factorization (1997) (35)
- Cryptanalysis of HFE with Internal Perturbation (2007) (32)
- Report on the AES Candidates (1999) (30)
- The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm (2002) (29)
- An Efficient Provable Distinguisher for HFE (2006) (28)
- Total Break of the l-IC Signature Scheme (2008) (28)
- Almost Uniform Density of Power Residues and the Provable Security of ESIGN (2003) (27)
- Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC '97 (1998) (26)
- CS-Cipher (1998) (26)
- An Alternative to the Fiat-Shamir Protocol (1989) (24)
- Key Recovery on Hidden Monomial Multivariate Schemes (2008) (24)
- Software-Hardware Trade-Offs: Application to A5/1 Cryptanalysis (2000) (24)
- Regularity properties of definable sets of reals (1985) (24)
- Threshold Ring Signatures for Ad-hoc Groups (2002) (23)
- Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems (1991) (23)
- The Effectiveness of Lattice Attacks Against Low-Exponent RSA (1999) (22)
- SVP: A Flexible Micropayment Scheme (1997) (22)
- Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes (2006) (21)
- Comments by the NESSIE Project on the AES Finalists (2000) (21)
- Cryptanalysis of Tweaked Versions of SMASH and Reparation (2009) (21)
- Advances in Cryptology - EUROCRYPT 2004 (2004) (21)
- Linear Bandwidth Naccache-Stern Encryption (2008) (20)
- Effective partitions of the real line into Borel sets of bounded rank (1980) (17)
- A ramsey theorem for trees, with an application to Banach spaces (1978) (17)
- New Attacks against Standardized MACs (2003) (17)
- The Hanf number of the first order theory of Banach spaces (1978) (15)
- Cryptanalysis of an Efficient Proof of Knowledge of Discrete Logarithm (2006) (14)
- Advances in cryptology-EUROCRYPT '99 : International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999 : proceedings (1999) (13)
- Approximating the Number of Error Locations within a Constant Ratio is NP-complete (1993) (13)
- The problem of envelopes for Banach spaces (1976) (13)
- Cryptanalysis of Another Knapsack Cryptosystem (1991) (13)
- The action of a few permutations on r-tuples is quickly transitive (1998) (13)
- The Cryptanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks (1991) (13)
- Cryptanalysis of a Public-Key Cryptosystem Based on Approximations by Rational Numbers (1991) (13)
- A Converse to the Ajtai-Dwork Security Proof and its Cryptographic Implications (1998) (13)
- Decorrelated Fast Cipher: an AES Candidate (Extended Abstract) (1998) (11)
- Some measure theoretic results in effective descriptive set theory (1975) (11)
- Can One Design a Signature Scheme Based on Error-Correctin Codes? (1994) (10)
- Partitions of the real line into X1 closed sets (1978) (9)
- XMX: A Firmware-Oriented Block Cipher Based on Modular Multiplications (1997) (8)
- The Validation of Cryptographic Algorithms (1996) (8)
- Polynomial-time construction of codes II. Spherical codes and the kissing number of spheres (1994) (8)
- A new look at the interpolation problem (1975) (7)
- The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography (1996) (7)
- Analytic Equivalence Relations and Coanalytic Games (1982) (6)
- The action of a few permutations on r -tuples is quickly transitive (1998) (6)
- Cryptanalysis of the OTM Signature Scheme from FC'02 (2003) (6)
- The cryptanalysis of a public-key implementation of finite group mappings (1995) (6)
- Proceedings of the 17th international conference on Theory and application of cryptographic techniques (1999) (5)
- Pfsfect Set Theorems for Analytic and Coanalytic Equivalence Relations. (1978) (5)
- Dfc Update (1999) (4)
- Lattices and Cryptography: An Overview (1998) (4)
- Generic extensions which do not ADD random reals (1985) (4)
- Linear Cryptanalysis of Non Binary Ciphers (with an application to SAFER) (2007) (3)
- Advances in Cryptology – CRYPTO 2018 (2018) (3)
- Evaluation Report on the ECDSA signature scheme (2001) (2)
- Cryptography and the French Banking Cards: Past, Present, Future (2004) (2)
- Weakness of a Public-Key Cryptosystem Based on Factorizations of Finite Groups (1994) (2)
- Polynomial-time construction of linear codes with almost equal weights (1993) (2)
- Evaluation Report on the Factoring Problem (2001) (2)
- Proceedings of the Herbrand Symposium : Logic Colloquium '81 : proceedings of the Herbrand Symposium held in Marseilles, France, July 1981 (1982) (2)
- Cryptography and the Methodology of Provable Security (2003) (1)
- Research Agenda for the Future of Cryptology † (2003) (1)
- Polynomial-Time Construction of Spherical Codes (1991) (1)
- Evaluation Report on the Discrete Logarithm Problem over finite fields (2001) (1)
- SVP : a Flexible MicropaymentSchemeJacques (1997) (1)
- SVP : a Flexible MicropaymentSchemeJacques (1997) (1)
- E cient Revocation in Group SignaturesEmmanuel (2001) (1)
- Decorrelated Fast Cipher : an AES (1998) (1)
- Cryptanalysis of the SFLASH Signature Scheme (2007) (1)
- Polynomial-time construction of codes I: Linear codes with almost equal weights (1992) (1)
- Proceedings of the Herbrand Symposium Logic Colloquium '81 ... Held in Marseilles, France, July 1981 (1982) (1)
- Visual Cryptography with Polarization (2006) (0)
- J. V. Boone, A Brief History of Cryptology. (2008) (0)
- Mathematics, Cryptology, Security (2010) (0)
- Public key identification method for authentication of bank cards or identity cards (1997) (0)
- Duong Hieu PHAN France Telecom Research and Development duonghieu (2007) (0)
- Evaluation Report on the ESIGN signature scheme (2001) (0)
- Cryptography (Dagstuhl Seminar 02391) (2021) (0)
- Report on the Aes Candidates 1 on the Aes Candidates 1.1 on the Aes Evaluation Platform (1999) (0)
- New Results - Cryptanalysis (Mathematical) (2008) (0)
- A Brief History of Cryptology (review) (2008) (0)
- Method for authentication bit reduced number transmitted (1994) (0)
- The Security of Cryptographic Primitives (1995) (0)
- Most Regular Graphs are (1994) (0)
- Weaknesses of a public-key cryptosystem basedon factorizations of nite groupsSimon (0)
- Cryptography Method has public key based on the discrete logarithm (1995) (0)
- Statistical Inference, Zero Knowledge and Proofs of Identity (1994) (0)
- Identifying method public key using two hash functions (1998) (0)
- Counting the Number of Equivalence Classes of Borel and Coanalytic Equivalence Relations.Equivalences Generated by Families of Borel Sets.A Reflection Phenomenon in Descriptive Set Theory.Equivalence Relations, Projective and Beyond.Counting Equivalence Classes for co-κ-Souslin Equivalence Relations (1987) (0)
- Linear Bandwidth Naccache-Stern Encryption (To appear in R. Ostrovsky, Ed., Sixth Conference on Security and Cryptography for Networks - SCN 2008 , vol. ? of Lecture Notes in Computer Science, pp. ???{???, Springer-Verlag, 2008.) (2008) (0)
- Method for identifying a public key using two hash functions (1997) (0)
- Method for identifying a public key (1997) (0)
- The Herbrand Symposium: (Marseilles July 16-July 24 1981) (1983) (0)
This paper list is powered by the following services:
Other Resources About Jacques Stern
What Schools Are Affiliated With Jacques Stern?
Jacques Stern is affiliated with the following schools:
