Benôıt Libert

7.6k total citations
28 papers, 936 citations indexed

About

Benôıt Libert is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Benôıt Libert has authored 28 papers receiving a total of 936 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Artificial Intelligence, 16 papers in Computational Theory and Mathematics and 4 papers in Information Systems. Recurrent topics in Benôıt Libert's work include Cryptography and Data Security (28 papers), Complexity and Algorithms in Graphs (16 papers) and Privacy-Preserving Technologies in Data (13 papers). Benôıt Libert is often cited by papers focused on Cryptography and Data Security (28 papers), Complexity and Algorithms in Graphs (16 papers) and Privacy-Preserving Technologies in Data (13 papers). Benôıt Libert collaborates with scholars based in France, Belgium and United States. Benôıt Libert's co-authors include Jean-Jacques Quisquater, Damien Vergnaud, Noel McCullagh, Moti Yung, Marc Jóye, Nuttapong Attrapadung, Javier Herranz, Élie de Panafieu, Fabien Laguillaumie and Carla Ràfols and has published in prestigious journals such as IEEE Transactions on Information Theory, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Benôıt Libert

25 papers receiving 866 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Benôıt Libert France 12 863 387 303 262 91 28 936
Futai Zhang China 19 995 1.2× 488 1.3× 265 0.9× 466 1.8× 87 1.0× 88 1.1k
Carmit Hazay Israel 15 688 0.8× 250 0.6× 206 0.7× 103 0.4× 101 1.1× 45 773
Keita Emura Japan 12 461 0.5× 206 0.5× 160 0.5× 95 0.4× 66 0.7× 73 509
Joppe W. Bos Belgium 11 584 0.7× 269 0.7× 73 0.2× 98 0.4× 146 1.6× 30 672
Rongmao Chen China 14 706 0.8× 386 1.0× 122 0.4× 166 0.6× 135 1.5× 44 796
Anna Lysyanskaya United States 16 738 0.9× 310 0.8× 80 0.3× 272 1.0× 44 0.5× 35 848
Michel Abdalla⋆ France 12 461 0.5× 296 0.8× 100 0.3× 266 1.0× 100 1.1× 37 621
Lunzhi Deng China 12 312 0.4× 191 0.5× 70 0.2× 171 0.7× 63 0.7× 75 432
Junzuo Lai China 15 1.0k 1.2× 664 1.7× 242 0.8× 131 0.5× 69 0.8× 46 1.1k
Sung‐Ming Yen Taiwan 12 519 0.6× 336 0.9× 63 0.2× 124 0.5× 145 1.6× 34 621

Countries citing papers authored by Benôıt Libert

Since Specialization
Citations

This map shows the geographic impact of Benôıt Libert's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Benôıt Libert with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Benôıt Libert more than expected).

Fields of papers citing papers by Benôıt Libert

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Benôıt Libert. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Benôıt Libert. The network helps show where Benôıt Libert may publish in the future.

Co-authorship network of co-authors of Benôıt Libert

This figure shows the co-authorship network connecting the top 25 collaborators of Benôıt Libert. A scholar is included among the top collaborators of Benôıt Libert based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Benôıt Libert. Benôıt Libert is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Libert, Benôıt, San Ling, Khoa Nguyen, & Huaxiong Wang. (2023). Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors. Journal of Cryptology. 36(3). 2 indexed citations
2.
Libert, Benôıt, et al.. (2022). Updatable Public Key Encryption from DCR. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. 11–22. 1 indexed citations
3.
Libert, Benôıt, et al.. (2021). Adaptive oblivious transfer with access control from lattice assumptions. Theoretical Computer Science. 891. 210–229. 1 indexed citations
4.
Libert, Benôıt, et al.. (2021). Adaptively Secure Distributed PRFs from $$\textsf {LWE}$$. Journal of Cryptology. 34(3). 1 indexed citations
5.
Libert, Benôıt & Moti Yung. (2020). Adaptively Secure Non-interactive CCA-Secure Threshold Cryptosystems: Generic Framework and Constructions. Journal of Cryptology. 33(4). 1405–1441.
6.
Libert, Benôıt, et al.. (2019). Zero-knowledge arguments for matrix–vector relations and lattice-based group encryption. Theoretical Computer Science. 759. 72–97.
7.
Libert, Benôıt, Marc Jóye, & Moti Yung. (2016). Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares. Theoretical Computer Science. 645. 1–24. 28 indexed citations
8.
Benhamouda, Fabrice, Marc Jóye, & Benôıt Libert. (2016). A New Framework for Privacy-Preserving Aggregation of Time-Series Data. ACM Transactions on Information and System Security. 18(3). 1–21. 30 indexed citations
9.
Libert, Benôıt, Thomas Peters, Marc Jóye, & Moti Yung. (2015). Linearly homomorphic structure-preserving signatures and their applications. Designs Codes and Cryptography. 77(2-3). 441–477. 15 indexed citations
10.
Libert, Benôıt & Moti Yung. (2013). Adaptively secure non-interactive threshold cryptosystems. Theoretical Computer Science. 478. 76–100. 6 indexed citations
11.
Libert, Benôıt, Kenneth G. Paterson, & Elizabeth A. Quaglia. (2012). Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model. Lecture notes in computer science. 7293. 206–224. 20 indexed citations
12.
Attrapadung, Nuttapong, Javier Herranz, Fabien Laguillaumie, et al.. (2011). Attribute-based encryption schemes with constant-size ciphertexts. Theoretical Computer Science. 422. 15–38. 112 indexed citations
13.
Attrapadung, Nuttapong & Benôıt Libert. (2011). Functional encryption for public-attribute inner products: Achieving constant-size ciphertexts with adaptive security or support for negation. Journal of Mathematical Cryptology. 5(2). 115–158. 10 indexed citations
14.
Libert, Benôıt & Damien Vergnaud. (2011). Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption. IEEE Transactions on Information Theory. 57(3). 1786–1802. 93 indexed citations
15.
Libert, Benôıt & Moti Yung. (2011). Efficient traceable signatures in the standard model. Theoretical Computer Science. 412(12-14). 1220–1242. 3 indexed citations
16.
Libert, Benôıt, Jean-Jacques Quisquater, & Moti Yung. (2010). Key Evolution Systems in Untrusted Update Environments. ACM Transactions on Information and System Security. 13(4). 1–34. 4 indexed citations
17.
Libert, Benôıt & Jean-Jacques Quisquater. (2005). Improved signcryption from q-Diffie-Hellman problems. Lecture notes in computer science. 3352. 220–234. 8 indexed citations
18.
Quisquater, Jean-Jacques, et al.. (2005). Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. Lecture notes in computer science. 3788. 515–532. 263 indexed citations
19.
Libert, Benôıt & Jean-Jacques Quisquater. (2004). A new identity based signcryption scheme from pairings. 155–158. 148 indexed citations
20.
Libert, Benôıt & Jean-Jacques Quisquater. (2003). Efficient revocation and threshold pairing based cryptosystems. 163–171. 73 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Futai Zhang Breakdown of academic impact, for papers by Carmit Hazay Breakdown of academic impact, for papers by Keita Emura Breakdown of academic impact, for papers by Joppe W. Bos Breakdown of academic impact, for papers by Rongmao Chen Breakdown of academic impact, for papers by Anna Lysyanskaya Breakdown of academic impact, for papers by Michel Abdalla⋆ Breakdown of academic impact, for papers by Lunzhi Deng Breakdown of academic impact, for papers by Junzuo Lai Breakdown of academic impact, for papers by Sung‐Ming Yen
Rankless by CCL
2026