D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 49 Citations 12,012 100 World Ranking 2994 National Ranking 62

Overview

What is he best known for?

The fields of study he is best known for:

  • Cryptography
  • Algebra
  • Public-key cryptography

His primary areas of study are Theoretical computer science, Cryptography, Computer security, Public-key cryptography and Discrete mathematics. His studies deal with areas such as Mathematical proof, Plaintext-aware encryption, Deterministic encryption, Semantic security and Cryptosystem as well as Theoretical computer science. His Cryptography research includes elements of Identification scheme, Group and Encryption.

In general Computer security, his work in Random oracle, Blind signature and Paillier cryptosystem is often linked to Electronic voting linking many areas of study. His Public-key cryptography research is multidisciplinary, incorporating perspectives in Smart card and Provable security. He has researched Discrete mathematics in several fields, including Dimension, McEliece cryptosystem, Niederreiter cryptosystem and Binary code.

His most cited work include:

  • Security Arguments for Digital Signatures and Blind Signatures (1561 citations)
  • Security proofs for signature schemes (846 citations)
  • A method for finding codewords of small weight (316 citations)

What are the main themes of his work throughout his whole career to date?

The scientist’s investigation covers issues in Cryptography, Theoretical computer science, Public-key cryptography, Discrete mathematics and Computer security. His studies in Cryptography integrate themes in fields like Identification scheme, Smart card and Key. His research integrates issues of Mathematical proof, Digital signature, Encryption, Semantic security and Arithmetic in his study of Theoretical computer science.

His Public-key cryptography study combines topics from a wide range of disciplines, such as Cryptosystem and Cryptanalysis. His Discrete mathematics course of study focuses on Combinatorics and Linear code and Upper and lower bounds. As part of one scientific family, he deals mainly with the area of Computer security, narrowing it down to issues related to the Signature, and often NESSIE.

He most often published in these fields:

  • Cryptography (32.95%)
  • Theoretical computer science (35.23%)
  • Public-key cryptography (30.11%)

What were the highlights of his more recent work (between 2002-2010)?

  • Public-key cryptography (30.11%)
  • Cryptography (32.95%)
  • Cryptanalysis (16.48%)

In recent papers he was focusing on the following fields of study:

Jacques Stern focuses on Public-key cryptography, Cryptography, Cryptanalysis, Theoretical computer science and Algorithm. Public-key cryptography is a subfield of Computer security that Jacques Stern studies. Jacques Stern has researched Cryptography in several fields, including Discrete mathematics, Discrete logarithm and Contactless smart card.

His Cryptanalysis study combines topics in areas such as Signature, Hidden Field Equations and Computation. His research investigates the connection with Theoretical computer science and areas like Block cipher which intersect with concerns in Message authentication code and Stream cipher. His Algorithm research includes elements of Simple and Authentication.

Between 2002 and 2010, his most popular works were:

  • Practical cryptanalysis of SFLASH (132 citations)
  • RSA-OAEP Is Secure under the RSA Assumption (110 citations)
  • On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order (100 citations)

In his most recent research, the most cited papers focused on:

  • Algebra
  • Cryptography
  • Public-key cryptography

Public-key cryptography, Algorithm, Cryptanalysis, Cryptosystem and Provable security are his primary areas of study. Jacques Stern interconnects Signature, Smart card and Theoretical computer science in the investigation of issues within Public-key cryptography. The study incorporates disciplines such as Lattice problem, Subset sum problem, Knapsack problem, Encryption and Combinatorial optimization in addition to Theoretical computer science.

Particularly relevant to Cryptography is his body of work in Algorithm. His Cryptosystem research focuses on Differential cryptanalysis and how it relates to Linear cryptanalysis and Linear algebra. His Random oracle research extends to the thematically linked field of Provable security.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Security Arguments for Digital Signatures and Blind Signatures

David Pointcheval;Jacques Stern.
Journal of Cryptology (2000)

2295 Citations

Security proofs for signature schemes

David Pointcheval;Jacques Stern.
theory and application of cryptographic techniques (1996)

1316 Citations

A method for finding codewords of small weight

Jacques Stern;Jacques Stern.
Proceedings of the third international colloquium on Coding theory and applications (1989)

494 Citations

A new public key cryptosystem based on higher residues

David Naccache;Jacques Stern.
computer and communications security (1998)

482 Citations

The hardness of approximate optima in lattices, codes, and systems of linear equations

S. Arora;L. Babai;J. Stern;Z. Sweedyk.
foundations of computer science (1993)

436 Citations

Practical multi-candidate election system

Olivier Baudron;Pierre-Alain Fouque;David Pointcheval;Jacques Stern.
principles of distributed computing (2001)

400 Citations

Sharing Decryption in the Context of Voting or Lotteries

Pierre-Alain Fouque;Guillaume Poupard;Jacques Stern.
financial cryptography (2000)

389 Citations

Threshold Ring Signatures and Applications to Ad-hoc Groups

Emmanuel Bresson;Jacques Stern;Michael Szydlo.
international cryptology conference (2002)

356 Citations

A new identification scheme based on syndrome decoding

Jacques Stern.
international cryptology conference (1993)

354 Citations

Provably Secure Blind Signature Schemes

David Pointcheval;Jacques Stern.
international cryptology conference (1996)

347 Citations

Best Scientists Citing Jacques Stern

Willy Susilo

Willy Susilo

University of Wollongong

Publications: 85

David Pointcheval

David Pointcheval

École Normale Supérieure

Publications: 84

Yi Mu

Yi Mu

Fujian Normal University

Publications: 65

Igor E. Shparlinski

Igor E. Shparlinski

UNSW Sydney

Publications: 49

Mihir Bellare

Mihir Bellare

University of California, San Diego

Publications: 49

Bart Preneel

Bart Preneel

KU Leuven

Publications: 43

David Naccache

David Naccache

École Normale Supérieure

Publications: 43

Benoît Libert

Benoît Libert

École Normale Supérieure de Lyon

Publications: 42

Duncan S. Wong

Duncan S. Wong

City University of Hong Kong

Publications: 41

Pierre-Alain Fouque

Pierre-Alain Fouque

University of Rennes 1

Publications: 39

Joseph K. Liu

Joseph K. Liu

Monash University

Publications: 39

Moti Yung

Moti Yung

Columbia University

Publications: 38

Philippe Gaborit

Philippe Gaborit

University of Limoges

Publications: 38

Fangguo Zhang

Fangguo Zhang

Sun Yat-sen University

Publications: 38

Xiaofeng Chen

Xiaofeng Chen

Xidian University

Publications: 37

Zhenfu Cao

Zhenfu Cao

East China Normal University

Publications: 36

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us
Something went wrong. Please try again later.