Benoît Libert

发表

Attribute-based encryption schemes with constant-size ciphertexts

Javier Herranz, Carla Ràfols, Nuttapong Attrapadung, 2012, Theor. Comput. Sci..

A New Framework for Privacy-Preserving Aggregation of Time-Series Data

Marc Joye, Fabrice Benhamouda, Benoît Libert, 2016, TSEC.

Key Evolution Systems in Untrusted Update Environments

Moti Yung, Jean-Jacques Quisquater, Benoît Libert, 2008, Inscrypt.

Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation

Nuttapong Attrapadung, Benoît Libert, Benoît Libert, 2010, Public Key Cryptography.

Cryptanalysis of a Verifiably Committed Signature Scheme Based on GPS and RSA

Jean-Jacques Quisquater, Benoît Libert, Julien Cathalo, 2004, ISC.

Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model

Benoît Libert, Damien Vergnaud, Damien Vergnaud, 2009, CANS.

Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts

Nuttapong Attrapadung, Benoît Libert, Elie de Panafieu, 2011, Public Key Cryptography.

Practical Time Capsule Signatures in the Standard Model from Bilinear Maps

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2007, Pairing.

Certificateless Encryption Schemes Strongly Secure in the Standard Model

Kenneth G. Paterson, Benoît Libert, Alexander W. Dent, 2008, Public Key Cryptography.

A Lattice-Based Group Signature Scheme with Message-Dependent Opening

Benoît Libert, Khoa Nguyen, Fabrice Mouhartem, 2016, ACNS.

Dynamic fully forward-secure group signatures

Moti Yung, Benoît Libert, M. Yung, 2010, ASIACCS '10.

Adaptively Secure Forward-Secure Non-interactive Threshold Cryptosystems

Moti Yung, Benoît Libert, M. Yung, 2011, Inscrypt.

Computing on Authenticated Data: New Privacy Definitions and Constructions

Thomas Peters, Nuttapong Attrapadung, Benoît Libert, 2012, ASIACRYPT.

Adaptively secure non-interactive threshold cryptosystems

Moti Yung, Benoît Libert, 2013, Theor. Comput. Sci..

Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security

Marc Fischlin, Mark Manulis, Benoît Libert, 2011, ASIACRYPT.

Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares

Moti Yung, Marc Joye, Benoît Libert, 2016, Theor. Comput. Sci..

Improved Signcryption from q-Diffie-Hellman Problems

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2004, SCN.

Efficient Intrusion-Resilient Signatures Without Random Oracles

Moti Yung, Jean-Jacques Quisquater, Benoît Libert, 2006, Inscrypt.

Adaptively Secure Distributed PRFs from LWE\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {LWE}$$\end{documen

Damien Stehlé, Benoît Libert, Radu Titiu, 2018, Journal of Cryptology.

Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions

Huaxiong Wang, Benoît Libert, San Ling, 2016, ASIACRYPT.

Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption

Benoît Libert, Damien Vergnaud, Damien Vergnaud, 2008, Public Key Cryptography.

Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions

Moti Yung, Thomas Peters, Benoît Libert, 2015, CRYPTO.

Group Encryption: Non-interactive Realization in the Standard Model

Moti Yung, Benoît Libert, Julien Cathalo, 2009, ASIACRYPT.

The Exact Security of an Identity Based Signature and its Applications

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2004, IACR Cryptol. ePrint Arch..

Efficient and Non-interactive Timed-Release Encryption

Jean-Jacques Quisquater, Benoît Libert, Julien Cathalo, 2005, ICICS.

Homomorphic Network Coding Signatures in the Standard Model

Nuttapong Attrapadung, Benoît Libert, Benoît Libert, 2011, Public Key Cryptography.

Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps

Paulo S. L. M. Barreto, Jean-Jacques Quisquater, Benoît Libert, 2005, ASIACRYPT.

Security and Cryptography for Networks

Jie Chen, Benoît Libert, Somindu C. Ramanna, 2016, Lecture Notes in Computer Science.

Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs

Moti Yung, Benoît Libert, M. Yung, 2010, TCC.

Signcryption Schemes Based on Bilinear Maps

Paulo S. L. M. Barreto, Jean-Jacques Quisquater, Benoît Libert, 2010, Practical Signcryption.

Short Attribute-Based Signatures for Threshold Predicates

Javier Herranz, Carla Ràfols, Fabien Laguillaumie, 2012, CT-RSA.

Towards Practical Black-Box Accountable Authority IBE: Weak Black-Box Traceability With Short Ciphertexts and Private Keys

Benoît Libert, Damien Vergnaud, Damien Vergnaud, 2011, IEEE Transactions on Information Theory.

Efficient Cryptosystems From 2k-th Power Residue Symbols

Marc Joye, Benoît Libert, Benoît Libert, 2013, IACR Cryptol. ePrint Arch..

Zero-Knowledge Elementary Databases with More Expressive Queries

Huaxiong Wang, Benoît Libert, Khoa Nguyen, 2019, Public Key Cryptography.

Adaptive Oblivious Transfer with Access Control from Lattice Assumptions

Huaxiong Wang, Benoît Libert, San Ling, 2017, ASIACRYPT.

Efficient traceable signatures in the standard model

Moti Yung, Benoît Libert, 2011, Theor. Comput. Sci..

Universal Designated Verifier Signatures Without Random Oracles or Non-black Box Assumptions

Jean-Jacques Quisquater, Fabien Laguillaumie, Benoît Libert, 2006, SCN.

On Constructing Certificateless Cryptosystems from Identity Based Encryption

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2006, Public Key Cryptography.

Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures

Thomas Peters, Nuttapong Attrapadung, Benoît Libert, 2013, Public Key Cryptography.

Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts

Thomas Peters, Benoît Libert, Chen Qian, 2017, Public Key Cryptography.

Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption

Huaxiong Wang, Benoît Libert, San Ling, 2019, Theor. Comput. Sci..

Parallel Key-Insulated Public Key Encryption Without Random Oracles

Moti Yung, Jean-Jacques Quisquater, Benoît Libert, 2007, Public Key Cryptography.

Group Signatures with Almost-for-Free Revocation

Moti Yung, Thomas Peters, Benoît Libert, 2012, CRYPTO.

Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption

Benoît Libert, Damien Vergnaud, Damien Vergnaud, 2008, IEEE Transactions on Information Theory.

Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves

Marc Joye, Benoît Libert, Benoît Libert, 2017, CT-RSA.

Efficient revocation and threshold pairing based cryptosystems

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2003, PODC '03.

A Scalable Scheme for Privacy-Preserving Aggregation of Time-Series Data

Marc Joye, Benoît Libert, Benoît Libert, 2013, Financial Cryptography.

Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys

Benoît Libert, Damien Vergnaud, Damien Vergnaud, 2008, Public Key Cryptography.

Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2004, Public Key Cryptography.

Lattice-Based Group Signatures with Logarithmic Signature Size

Damien Stehlé, Adeline Langlois, Fabien Laguillaumie, 2013, ASIACRYPT.

Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares

Moti Yung, Marc Joye, Benoît Libert, 2014, Theor. Comput. Sci..

Practical "Signatures with Efficient Protocols" from Simple Assumptions

Moti Yung, Thomas Peters, Benoît Libert, 2016, AsiaCCS.

Multi-use unidirectional proxy re-signatures

Benoît Libert, Damien Vergnaud, Damien Vergnaud, 2008, CCS.

Lattice-Based Zero-Knowledge Arguments for Integer Relations

Huaxiong Wang, Benoît Libert, San Ling, 2018, CRYPTO.

Functional encryption for public-attribute inner products: Achieving constant-size ciphertexts with adaptive security or support for negation

Nuttapong Attrapadung, Benoît Libert, Benoît Libert, 2012, J. Math. Cryptol..

Lossy Algebraic Filters with Short Tags

Benoît Libert, Chen Qian, 2019, Public Key Cryptography.

Key Evolution Systems in Untrusted Update Environments

Moti Yung, Jean-Jacques Quisquater, Benoît Libert, 2009, TSEC.

Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors

Huaxiong Wang, Benoît Libert, San Ling, 2016, Journal of Cryptology.

Identity Based Undeniable Signatures

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2004, CT-RSA.

Identity-Based Cryptosystems

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2011, Encyclopedia of Cryptography and Security.

A new identity based signcryption scheme from pairings

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

Identity-Based Cryptosystems

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2011, Encyclopedia of Cryptography and Security.

Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures

Moti Yung, Marc Joye, Thomas Peters, 2014, IACR Cryptol. ePrint Arch..

Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions

Moti Yung, Benoît Libert, Somindu C. Ramanna, 2016, ICALP.

What Is Possible with Identity Based Cryptography for PKIs and What Still Must Be Improved

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2004, EuroPKI.

Scalable Group Signatures with Revocation

Moti Yung, Thomas Peters, Benoît Libert, 2012, EUROCRYPT.

Identity-Based Lossy Trapdoor Functions: New Definitions, Hierarchical Extensions, and Implications

Javier Herranz, Carla Ràfols, Benoît Libert, 2014, Public Key Cryptography.

Adaptively Secure Distributed PRFs from \mathsf LWE

Damien Stehlé, Benoît Libert, Radu Titiu, 2018, TCC.

Group Signatures with Message-Dependent Opening in the Standard Model

Marc Joye, Benoît Libert, Benoît Libert, 2014, CT-RSA.

Forward-secure signatures in untrusted update environments: efficient and generic constructions

Moti Yung, Jean-Jacques Quisquater, Benoît Libert, 2007, CCS '07.

Signcryption Schemes Based on the Diffie-Hellman Problem

Paulo S. L. M. Barreto, Jean-Jacques Quisquater, Benoît Libert, 2010, Practical Signcryption.

Logarithmic-Size Ring Signatures with Tight Security from the DDH Assumption

Thomas Peters, Benoît Libert, Chen Qian, 2018, ESORICS.

Compactly Hiding Linear Spans - Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications

Moti Yung, Marc Joye, Thomas Peters, 2015, ASIACRYPT.

Secure Efficient History-Hiding Append-Only Signatures in the Standard Model

Moti Yung, Marc Joye, Thomas Peters, 2015, Public Key Cryptography.

Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security

Rafail Ostrovsky, Brett Hemenway, Benoît Libert, 2011, ASIACRYPT.

Linearly homomorphic structure-preserving signatures and their applications

Moti Yung, Marc Joye, Thomas Peters, 2013, Designs, Codes and Cryptography.

Efficient Accountable Authority Identity-Based Encryption under Static Complexity Assumptions pdf

Benoît Libert, Damien Vergnaud, 2008, ArXiv.

Compact IBBE and Fuzzy IBE from Simple Assumptions

Benoît Libert, Junqing Gong, Somindu C. Ramanna, 2018, SCN.

Anonymous Broadcast Encryption

Kenneth G. Paterson, Benoît Libert, Elizabeth A. Quaglia, 2011, IACR Cryptol. ePrint Arch..

Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes

Benoît Libert, Malika Izabachène, Damien Vergnaud, 2011, IMACC.

Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash

Huaxiong Wang, Benoît Libert, San Ling, 2017, ASIACRYPT.

Divisible E-Cash in the Standard Model

Benoît Libert, Malika Izabachène, Benoît Libert, 2012, Pairing.

Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions

Georg Fuchsbauer, Marc Fischlin, Anja Lehmann, 2010, AFRICACRYPT.

Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption

Huaxiong Wang, Benoît Libert, San Ling, 2016, ASIACRYPT.

Hierarchical Identity-Based Lossy Trapdoor Functions

Javier Herranz, Carla Ràfols, Benoît Libert, 2012, IACR Cryptol. ePrint Arch..

Efficient Cryptosystems From $$\mathbf{2}^{{\varvec{k}}}$$2k-th Power Residue Symbols

Javier Herranz, Marc Joye, Fabrice Benhamouda, 2017, Journal of Cryptology.

Tracing Malicious Proxies in Proxy Re-encryption

Benoît Libert, Damien Vergnaud, Damien Vergnaud, 2008, Pairing.

Adaptive-ID Secure Revocable Identity-Based Encryption

Benoît Libert, Damien Vergnaud, Damien Vergnaud, 2009, CT-RSA.

Robust Encryption, Revisited

Kenneth G. Paterson, Pooya Farshim, Benoît Libert, 2013, Public Key Cryptography.

Adaptively secure non-interactive threshold cryptosystems

Moti Yung, Benoît Libert, M. Yung, 2011, Theor. Comput. Sci..

Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security

Moti Yung, Marc Joye, Thomas Peters, 2014, ASIACRYPT.

Identity Based Encryption Without Redundancy

Jean-Jacques Quisquater, Benoît Libert, J. Quisquater, 2005, ACNS.

Traceable Group Encryption

Moti Yung, Marc Joye, Thomas Peters, 2014, Public Key Cryptography.

Fully Forward-Secure Group Signatures

Moti Yung, Benoît Libert, M. Yung, 2012, Cryptography and Security.

Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model

Kenneth G. Paterson, Benoît Libert, Elizabeth A. Quaglia, 2012, Public Key Cryptography.

Efficient traceable signatures in the standard model

Moti Yung, Benoît Libert, M. Yung, 2009, Theor. Comput. Sci..

Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions

Moti Yung, Benoît Libert, M. Yung, 2012, TCC.

All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE

Ron Steinfeld, Damien Stehlé, Benoît Libert, 2017, CRYPTO.

Efficient Completely Non-malleable Public Key Encryption

Moti Yung, Benoît Libert, M. Yung, 2010, ICALP.

Non-interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings

Moti Yung, Thomas Peters, Benoît Libert, 2021, Public Key Cryptography.

Bifurcated Signatures: Folding the Accountability vs. Anonymity Dilemma into a Single Private Signing Scheme

Moti Yung, Thomas Peters, Benoît Libert, 2021, EUROCRYPT.

SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions

Dingding Jia, Benoît Libert, Benoît Libert, 2021, Designs, Codes and Cryptography.

Adaptive oblivious transfer with access control from lattice assumptions

Benoît Libert, San Ling, Khoa Nguyen, 2021, Theor. Comput. Sci..

Adaptively Secure Distributed PRFs from $$\textsf {LWE}$$ LWE

Damien Stehlé, Benoît Libert, Radu Titiu, 2021, J. Cryptol..

Fully Secure Functional Encryption for Linear Functions from Standard Assumptions

Damien Stehlé, Benoît Libert, Shweta Agrawal, 2015 .