H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 42 Citations 8,363 98 World Ranking 4163 National Ranking 87

Overview

What is he best known for?

The fields of study he is best known for:

  • Cryptography
  • Algebra
  • Public-key cryptography

Encryption, Theoretical computer science, Random oracle, Computer security and Public-key cryptography are his primary areas of study. His study involves Probabilistic encryption and Functional encryption, a branch of Encryption. His Theoretical computer science research incorporates themes from Signature and Ciphertext.

His Random oracle study combines topics from a wide range of disciplines, such as Algorithm, Cryptography and Signcryption. His study in the fields of Provable security and Standard model under the domain of Computer security overlaps with other disciplines such as Predicate. His study focuses on the intersection of Public-key cryptography and fields such as Cryptosystem with connections in the field of Certificateless cryptography, Key escrow and Cryptanalysis.

His most cited work include:

  • Efficient and provably-secure identity-based signatures and signcryption from bilinear maps (419 citations)
  • Unidirectional chosen-ciphertext secure proxy re-encryption (260 citations)
  • Expressive key-policy attribute-based encryption with constant-size ciphertexts (259 citations)

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

Benoît Libert mainly investigates Encryption, Theoretical computer science, Computer security, Public-key cryptography and Random oracle. His research integrates issues of Discrete mathematics and Cryptography in his study of Encryption. Benoît Libert interconnects Homomorphic encryption, Provable security, Identity and Plaintext-aware encryption in the investigation of issues within Theoretical computer science.

His Computer security study frequently links to other fields, such as Revocation. His work deals with themes such as Plaintext, Key generation and Digital signature, which intersect with Public-key cryptography. His Random oracle research is multidisciplinary, incorporating elements of Signature, Cryptographic primitive, Signcryption, Computer security model and Standard model.

He most often published in these fields:

  • Encryption (69.78%)
  • Theoretical computer science (48.92%)
  • Computer security (38.13%)

What were the highlights of his more recent work (between 2019-2021)?

  • Encryption (69.78%)
  • Mathematical proof (19.42%)
  • Theoretical computer science (48.92%)

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

His primary areas of investigation include Encryption, Mathematical proof, Theoretical computer science, Discrete mathematics and Cryptography. Ciphertext and Cryptosystem are among the areas of Encryption where Benoît Libert concentrates his study. His work on Functional encryption as part of general Ciphertext study is frequently connected to Randomness and Oracle, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.

His Cryptosystem research is multidisciplinary, relying on both Random oracle, Adaptive chosen-ciphertext attack, Public-key cryptography, Server and Standard model. Benoît Libert performs multidisciplinary study in the fields of Theoretical computer science and Lossy compression via his papers. Benoît Libert merges Cryptography with Pairing in his study.

Between 2019 and 2021, his most popular works were:

  • Adaptive Simulation Security for Inner Product Functional Encryption (5 citations)
  • Adaptive Simulation Security for Inner Product Functional Encryption (5 citations)
  • New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More (2 citations)

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

  • Cryptography
  • Algebra
  • Public-key cryptography

The scientist’s investigation covers issues in Encryption, Discrete mathematics, Ciphertext, Functional encryption and Key. He integrates many fields, such as Encryption and Pairing, in his works. Among his Pairing studies, you can observe a synthesis of other disciplines of science such as Group, Cryptography, Dual mode and Mathematical proof.

His Ciphertext study frequently draws connections between related disciplines such as Product. Benoît Libert has researched Computer security model in several fields, including Random oracle, Adaptive chosen-ciphertext attack, Public-key cryptography, Cryptosystem and Standard model. The concepts of his Standard model study are interwoven with issues in Theoretical computer science and Server.

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.

Top Publications

Efficient and provably-secure identity-based signatures and signcryption from bilinear maps

Paulo S. L. M. Barreto;Benoît Libert;Noel McCullagh;Jean-Jacques Quisquater.
international conference on the theory and application of cryptology and information security (2005)

615 Citations

Efficient and provably-secure identity-based signatures and signcryption from bilinear maps

Pslm Barreto;Jean-Jacques Quisquater;Benoît Libert;N McCullagh.
Lecture Notes in Computer Science (2005)

585 Citations

Unidirectional chosen-ciphertext secure proxy re-encryption

Benoît Libert;D Vergnaud.
public key cryptography (2008)

402 Citations

Expressive key-policy attribute-based encryption with constant-size ciphertexts

Nuttapong Attrapadung;Benoît Libert;Elie De Panafieu.
public key cryptography (2011)

401 Citations

A new identity based signcryption scheme from pairings

B. Libert;J.J. Quisquater.
information theory workshop (2003)

400 Citations

Attribute-based encryption schemes with constant-size ciphertexts

Nuttapong Attrapadung;Javier Herranz;Fabien Laguillaumie;Benoît Libert.
Theoretical Computer Science (2012)

226 Citations

New identity based signcryption schemes from pairings.

Benoît Libert;Jean-Jacques Quisquater.
IACR Cryptology ePrint Archive (2003)

222 Citations

Adaptive-ID Secure Revocable Identity-Based Encryption

Benoît Libert;Damien Vergnaud.
the cryptographers track at the rsa conference (2009)

194 Citations

Efficient signcryption with key privacy from gap Diffie-Hellman groups

Benoît Libert;Jean-Jacques Quisquater.
public key cryptography (2004)

194 Citations

On constructing certificateless cryptosystems from identity based encryption

Benoît Libert;Jean-Jacques Quisquater.
public key cryptography (2006)

191 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-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

Top Scientists Citing Benoît Libert

Willy Susilo

Willy Susilo

University of Wollongong

Publications: 111

Yi Mu

Yi Mu

Fujian Normal University

Publications: 69

Zhenfu Cao

Zhenfu Cao

East China Normal University

Publications: 44

Joseph K. Liu

Joseph K. Liu

Monash University

Publications: 43

Robert H. Deng

Robert H. Deng

Singapore Management University

Publications: 41

Guomin Yang

Guomin Yang

University of Wollongong

Publications: 40

Duncan S. Wong

Duncan S. Wong

City University of Hong Kong

Publications: 39

Man Ho Au

Man Ho Au

University of Hong Kong

Publications: 36

Jian Weng

Jian Weng

Jinan University

Publications: 35

Huaxiong Wang

Huaxiong Wang

Nanyang Technological University

Publications: 35

David Pointcheval

David Pointcheval

École Normale Supérieure

Publications: 34

C.Pandu Rangan

C.Pandu Rangan

Indian Institute of Technology Madras

Publications: 34

Qianhong Wu

Qianhong Wu

Beihang University

Publications: 32

Sherman S. M. Chow

Sherman S. M. Chow

Chinese University of Hong Kong

Publications: 31

Hoeteck Wee

Hoeteck Wee

École Normale Supérieure

Publications: 30

Something went wrong. Please try again later.