Benoît Libert
Artificial Intelligence · 2003–2013
A researcher in the Science corpus: 5 papers; trusts 46 researchers and is trusted by 11 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 81 citations into it; #12,322 of 35,345 by trust here, #19,873 by citations
- Computational Theory and Mathematics — 41 citations into it; #6,614 of 12,182 by trust here, #6,463 by citations
- Information Systems — 32 citations into it; #4,610 of 8,771 by trust here, #6,501 by citations
- Computer Vision and Pattern Recognition — 10 citations into it; #11,123 of 21,575 by trust here, #18,266 by citations
- Privacy & Security — 6 citations into it
- Computer Networks and Communications — 5 citations into it
- Electrical and Electronic Engineering — 5 citations into it
Whom Benoît Libert trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Dan Boneh
- Brent Waters
- Ran Canetti
- Amit Sahai
- Xavier Boyen
- Florian Hess
- Mihir Bellare
- Jae Choon Cha
- Cynthia Dwork
- Yevgeniy Dodis
Who trusts Benoît Libert overall
- Xavier Boyen
- Filipp Valovich
- Huaqun Wang
- Iraklis Leontiadis
- Jia-Lun Tsai
- Vincent Bindschaedler
- Xiaodong Lin
- Vanga Odelu
- Francesco Aldà
- Dan Boneh
Papers from Benoît Libert's perspective
Ordered by how strongly the researchers Benoît Libert trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- Short Signatures from the Weil Pairing
- Efficient Identity-Based Encryption Without Random Oracles (International Conference on the Theory and Application of Cryptographic Techniques)
- Identity-Based Encryption from the Weil Pairing
- New Directions in Cryptography
- Chosen-Ciphertext Security from Identity-Based Encryption (SIAM journal on computing (Print))
- Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles (IACR Cryptology ePrint Archive)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Hierarchical ID-Based Cryptography (International Conference on the Theory and Application of Cryptology and Information Security)
- Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption (International Conference on the Theory and Application of Cryptographic Techniques)
Their papers
- A new identity based signcryption scheme from pairings (2003) — 340 citations
- Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption (2008) — 445 citations
- Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps (2005) — 606 citations
- A Scalable Scheme for Privacy-Preserving Aggregation of Time-Series Data (2013) — 153 citations
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts (2011) — 428 citations