| Address: | Microelectronics Laboratory, Place du Levant, 3 |
| Office: | b.124 |
| Voice: | +32 (0) 10 47 80 62 |
| Fax: | +32 (0) 10 47 25 98 |
| E-Mail: | |
| Homepage: | http://perso.uclouvain.be/benoit.libert/ |
Publications
Benoit Libert, Thomas Peters, and Moti Yung. Scalable Group Signatures with Revocation, In D. Pointcheval, editor(s), Eurocrypt 2012, Lecture Notes in Computer Science, Spinger, April 2012, To appear BibTeX
Benoit Libert, and Moti Yung. Non-Interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions, In R. Cramer, editor(s), 9th Theory of Cryptography Conference (TCC 2012), Lecture Notes in Computer Science, Spinger, March 2012, To appear BibTeX
Javier Herranz, Fabien Laguillaumie, Benoit Libert, and Carla Ràfols. Short Attribute-Based Signatures for Threshold Predicates, In O. Dunkelman, editor(s), RSA Conference -- Cryptographers' Track 2012 (CT-RSA 2012), Volume 7178 of Lecture Notes in Computer Sciences, pages 51-67, Springer, February 2012 BibTeX
Malika Izabachène, Benoit Libert, and Damien Vergnaud. Block-wise P-signatures and Non-Interactive Anonymous Credentials with Efficient Attributes, In L. Chen, editor(s), 13th IMA International Conference on Cryptography and Coding (IMACC 2011), Volume 7089 of Lecture Notes on Computer Science, pages 431-450, Springer, December 2011, BibTeX
Brett Hemenway, Benoit Libert, Rafail Ostrovsky, and Damien Vergnaud. Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security, In D.-H. Lee & X. Wang, editor(s), Asiacrypt 2011, Volume 7073 of Lecture Notes in Computer Science, pages 70-88, Spinger, December 2011, BibTeX
Marc Fischlin, Benoit Libert, and Mark Manulis. Non-Interactive and Re-Usable Universally Composable String Commitments with Adaptive Security, In D.-H. Lee & X. Wang, editor(s), Asiacrypt 2011, Volume 7073 of Lecture Notes in Computer Science, pages 468-485, Spinger, December 2011, BibTeX
Benoit Libert, and Moti Yung. Adaptively Secure Non-Interactive Threshold Cryptosystems, In J. Sgall, L. Aceto & M. Henzinger, editor(s), 38th International Colloquium on Automata, Languages and Programming (ICALP 2011) - Track C, Volume 6756 of Lecture Notes in Computer Science (LNCS), pages 588-600, Springer, July 2011, BibTeX
Benoit Libert, and Moti Yung. Efficient Traceable Signatures in the Standard Model, In Theoretical Computer Science, Volume 412-12-14, pages 1220-1242, March 2011 BibTeX
Benoit Libert, and Damien Vergnaud. Unidirectional Chosen-Ciphertext Secure Proxy Re- Encryption, In IEEE Transactions on Information Theory, Volume 57-3, pages 1786-1802, March 2011 BibTeX
Nuttapong Attrapadung, and Benoit Libert. Homomorphic Network Coding Signatures in the Standard Model, In R. Gennaro, editor(s), Public Key Cryptography 2011 (PKC 2011), Volume 6571 of Lecture Notes in Computer Science (LNCS), pages 17-34, Springer, March 2011, BibTeX
Nuttapong Attrapadung, Benoit Libert, and Elie de Panafieu. Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts, In R. Gennaro, editor(s), Public Key Cryptography 2011 (PKC 2011), Volume 6571 of Lecture Notes in Computer Science (LNCS), pages 90-108, Springer, March 2011, BibTeX
Benoit Libert, Jean-Jacques Quisquater, and Moti Yung. Key Evolution Systems in Untrusted Update Environments, In ACM Transactions on Information and System Security (TISSEC), Volume 13-4, December 2010 BibTeX
Benoit Libert, and Moti Yung. Efficient Completely Non-Malleable Public Key Encryption, In P. Spirakis, S. Abramsky & F. Meyer auf der Heide, editor(s), 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) - Track A, Volume 6198 of Lecture Notes in Computer Science (LNCS), pages 127-139, Springer, July 2010, To appear BibTeX
Nuttapong Attrapadung, and Benoit Libert. Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation, In P. Nguyen and D. Pointcheval, editor(s), 13th International Conference on Practice and Theory in Public Key Cryptography (PKC 2010), Volume 6056 of Lecture Notes in Computer Science (LNCS), pages 384-402, Springer, May 2010 BibTeX
David Galindo, Benoit Libert, Marc Fischlin, Georg Fuchsbauer, Anja Lehmann, Mark Manulis, and Dominique Schröder. Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions, In D. Bernstein and T. Lange, editor(s), Progress in Cryptology - Africacrypt 2010, Volume 6055 of Lecture Notes in Computer Science (LNCS), pages 333-350, Springer, May 2010 BibTeX
Benoit Libert, and Moti Yung. Dynamic Fully Foward-Secure Group Signatures, In D. Basin and P. Liu, editor(s), 5th ACM Symposium on Information, Computer and Communications Security (AsiaCCS 2010), ACM Press, April 2010, to appear BibTeX
Benoit Libert, and Moti Yung. Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs, In D. Micciancio, editor(s), Theory of Cryptography Conference 2010 (TCC'10), Volume 5978 of Lecture Notes in Computer Science (LNCS), pages 499-517, Spinger, February 2010, BibTeX
Benoit Libert, and Damien Vergnaud. Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model, In A. Miyaji and J. Garay, editor(s), 8th International Conference on Cryptology and Network Security (CANS 2009), Volume 5888 of Lecture Notes in Computer Science, pages 498-517, Springer, December 2009 BibTeX
Julien Cathalo, Benoit Libert, and Moti Yung. Group Encryption: Non-Interactive Realization in the Standard Model, In M. Matsui, editor(s), Asiacrypt 2009, Volume 5912 of Lecture Notes in Computer Science, pages 179-196, Springer, December 2009 BibTeX
Benoit Libert, and Moti Yung. Efficient Traceable Signatures in the Standard Model, In H. Shacham and B. Waters, editor(s), 3rd International Conference on Pairing-Based Cryptography (Pairing 2009), Volume 5671 of Lecture Notes in Computer Science, pages 187-205, Springer, August 2009 BibTeX
Benoit Libert, and Damien Vergnaud. Adaptive-ID Secure Revocable Identity-Based Encryption, In M. Fischlin, editor(s), Topics in Cryptology - CT-RSA 2009, Volume 5473 of Lecture Notes in Computer Science, pages 1-15, Springer, April 2009 BibTeX
Benoit Libert, and Damien Vergnaud. Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys, In G. Tsudik and S. Jarecki, editor(s), Public Key Cryptography 2009 (PKC 2009), Volume 5443 of Lecture Notes in Computer Science, pages 235-255, Springer, March 2009 BibTeX
Benoit Libert, and Damien Vergnaud. Multi-Use Unidirectional Proxy Re-Signatures, In P. Syverson and S. Jha, editor(s), 15th ACM Conference on Computer and Communications Security (ACM-CCS 2008), pages 511-520, ACM Press, October 2008, BibTeX
Benoit Libert, and Damien Vergnaud. Tracing Malicious Proxies in Proxy Re-Encryption, In S. Galbraith and K. Paterson, editor(s), 2nd International Conference on Pairing-Based Cryptography (Pairing 2008), Volume 5209 of Lecture Notes in Computer Science, pages 332-353, Springer, September 2008, To Appear BibTeX
Benoit Libert, and Damien Vergnaud. Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption, In R. Cramer , editor(s), 11th International Workshop on Practice and Theory in Public Key Cryptography (PKC 2008), Volume 4939 of Lecture Notes in Computer Science, pages 360-379, Springer, March 2008 BibTeX
Alexander W. Dent, Benoit Libert, and Kenneth G. Paterson. Certificateless Encryption Schemes Strongly Secure in the Standard Model, In R. Cramer, editor(s), 11th International Workshop on Practice and Theory in Public-Key Cryptography (PKC 2008), Volume 4939 of Lecture Notes in Computer Science, pages 344-359, Springer, March 2008 BibTeX
Benoit Libert, Jean-Jacques Quisquater, and Moti Yung. Forward-Secure Signatures in Untrusted Update Environments: Efficient and Generic Constructions, In S. De Capitani di Vimercati and P. Syverson, editor(s), 14th ACM Conference on Computer and Communications Security (ACM CCS'07), pages 266-275, ACM, October 2007 BibTeX
Benoit Libert, and Jean-Jacques Quisquater. Practical Time Capsule Signatures in the Standard Model from Bilinear Maps, In T. Takagi and T. Okamoto, editor(s), 1st International Conference on Pairing-based Cryptography (Pairing 2007), Volume 4575 of Lecture Notes in Computer Science, pages 23-38, Springer, July 2007 BibTeX
Benoit Libert, Jean-Jacques Quisquater, and Moti Yung. Parallel Key-Insulated Public Key Encryption Without Random Oracles, In T. Okamoto and X. Wang, editor(s), Public Key Cryptography 2007 (PKC'07), Volume 4450 of Lecture Notes in Computer Science, pages 298-314, Springer, April 2007 BibTeX
Benoit Libert, Jean-Jacques Quisquater, and Moti Yung. Efficient Intrusion-Resilient Signatures Without Random Oracles, In H. Lipmaa and M. Yung, editor(s), Inscrypt 2006, Volume 4318 of Lecture Notes in Computer Science, pages 27-41, Springer, December 2006 BibTeX
Fabien Laguillaumie, Benoit Libert, and Jean-Jacques Quisquater. Universal Designated Verifier Signatures Without Random Oracles or Non-Black Box Assumptions, In R. De Prisco and M. Yung, editor(s), Security and Cryptography for Networks (SCN'06), Volume 4116 of Lecture Notes in Computer Science, pages 63-77, Springer, September 2006, To Appear BibTeX
Benoit Libert, and Jean-Jacques Quisquater. On Constructing Certificateless Cryptosystems from Identity Based Encryption, In M. Yung, editor(s), Public Key Cryptography 2006 (PKC'06), Volume 3958 of Lecture Notes in Computer Science, pages 474-490, Springer, April 2006 BibTeX
Paulo S. L. M. Barreto, Benoit Libert, Noel McCullagh, and Jean-Jacques Quisquater. Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps, In B. Roy, editor(s), Asiacrypt 2005, Volume 3788 of Lecture Notes in Computer Science, pages 515-532, Springer, December 2005 PDF BibTeX
Julien Cathalo, Benoit Libert, and Jean-Jacques Quisquater. Efficient and Non-Interactive Timed-Release Encryption, In S. Qing, W. Mao, J. Lopez and G. Wang, editor(s), Information and Communications Security: 7th International Conference, ICICS 2005, Volume 3783 of Lecture Notes in Computer Science, pages 291-303, Springer, December 2005 PDF BibTeX
Benoit Libert, and Jean-Jacques Quisquater. Identity Based Encryption without Redundancy, In J. Ioannidis, A. Keromytis and M. Yung, editor(s), 3rd Applied Cryptography and Network Security conference (ACNS'05), Volume 3531 of Lecture Notes in Computer Science, pages 285-300, Springer, June 2005 BibTeX
Julien Cathalo, Benoit Libert, and Jean-Jacques Quisquater. Cryptanalysis of a Verifiably Committed Signature Scheme based on GPS and RSA, In Kan Zhang, Yuliang Zheng, editor(s), Information Security Conference (ISC) 2004, Volume 3225 of Lecture Notes in Computer Science, pages 52-60, Springer-Verlag, September 2004 PDF BibTeX
Benoit Libert, and Jean-Jacques Quisquater. Improved Signcryption from q-Diffie-Hellman Problems, In Carlo Blundo, editor(s), 4h Conference on Security in Communication Networks '04 (SCN'04), Volume 3352 of Lecture Notes in Computer Science, pages 220-234, Spinger-Verlag, September 2004 BibTeX
Benoit Libert, and Jean-Jacques Quisquater. What Is Possible with Identity Based Cryptography for PKIs and What Still Must Be Improved, In S. Katsikas, S. Gritzalis, J. Lopez, editor(s), First European PKI Workshop (EuroPKI'04), Volume 3093 of Lecture Notes in Computer Science, pages 57-70, Springer-Verlag, June 2004 BibTeX
Benoit Libert, and Jean-Jacques Quisquater. Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups, In F. Bao, editor(s), Public Key Cryptography 2004 (PKC'04), Volume 2947 of Lecture Notes in Computer Science, pages 187-200, Spinger-Verlag, March 2004 PDF BibTeX
Benoit Libert, and Jean-Jacques Quisquater. Identity Based Undeniable Signatures, In T. Okamoto, editor(s), Cryptographer's Track -- RSA 2004, Volume 2964 of Lecture Notes in Computer Science, pages 112-125, Springer-Verlag, February 2004 PDF BibTeX
Benoit Libert, and Jean-Jacques Quisquater. New identity based signcryption schemes from pairings, IEEE Information Theory Workshop 2003, pages 155-158, January 2003, extended versio PDF BibTeX
Benoit Libert, and Jean-Jacques Quisquater. Efficient Revocation and Threshold Pairing Based Cryptosystems, 22nd Symposium on Principles of Distributed Computing (PODC 2003), pages 163-171, ACM Press, January 2003 PDF BibTeX