default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenoît Libert
Person information
- affiliation: ENS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c97]Benoît Libert:
Non-malleable Subvector Commitments. ASIACRYPT (3) 2024: 3-32- [c96]Benoît Libert:
Vector Commitments with Proofs of Smallness: Short Range Proofs and More. Public Key Cryptography (2) 2024: 36-67 - [c95]Benoît Libert:
Simulation-Extractable KZG Polynomial Commitments and Applications to HyperPlonk. Public Key Cryptography (2) 2024: 68-98 - [i41]Amit Deo, Marc Joye, Benoît Libert, Benjamin R. Curtis, Mayeul de Bellabre:
Homomorphic Evaluation of LWR-based PRFs and Application to Transciphering. IACR Cryptol. ePrint Arch. 2024: 665 (2024) - [i40]Benoît Libert:
Simulation-Extractable KZG Polynomial Commitments and Applications to HyperPlonk. IACR Cryptol. ePrint Arch. 2024: 854 (2024) - [i39]Benoît Libert:
Leveraging Small Message Spaces for CCA1 Security in Additively Homomorphic and BGN-type Encryption. IACR Cryptol. ePrint Arch. 2024: 920 (2024) - 2023
- [j17]Benoît Libert, San Ling, Khoa Nguyen
, Huaxiong Wang:
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors. J. Cryptol. 36(3): 23 (2023) - [c94]Clément Hoffmann, Benoît Libert, Charles Momin, Thomas Peters, François-Xavier Standaert:
POLKA: Towards Leakage-Resistant Post-quantum CCA-Secure Public Key Encryption. Public Key Cryptography (1) 2023: 114-144 - [i38]Benoît Libert:
Vector Commitments With Short Proofs of Smallness. IACR Cryptol. ePrint Arch. 2023: 800 (2023) - 2022
- [c93]Benoît Libert, Alain Passelègue, Mahshid Riahinia:
PointProofs, Revisited. ASIACRYPT (4) 2022: 220-246 - [c92]Calvin Abou Haidar, Benoît Libert, Alain Passelègue:
Updatable Public Key Encryption from DCR: Efficient Constructions With Stronger Security. CCS 2022: 11-22 - [c91]Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung:
One-Shot Fiat-Shamir-Based NIZK Arguments of Composite Residuosity and Logarithmic-Size Ring Signatures in the Standard Model. EUROCRYPT (2) 2022: 488-519 - [c90]Julien Devevey, Benoît Libert, Thomas Peters:
Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model. Public Key Cryptography (1) 2022: 615-646 - [c89]Benoît Libert, Alain Passelègue, Mahshid Riahinia:
New and Improved Constructions for Partially Equivocable Public Key Encryption. SCN 2022: 197-219 - [c88]Benoît Libert, Ky Nguyen, Alain Passelègue:
Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions. SCN 2022: 336-361 - [i37]Clément Hoffmann, Benoît Libert, Charles Momin, Thomas Peters, François-Xavier Standaert:
Towards Leakage-Resistant Post-Quantum CCA-Secure Public Key Encryption. IACR Cryptol. ePrint Arch. 2022: 873 (2022) - [i36]Benoît Libert, Ky Nguyen, Alain Passelègue:
Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions. IACR Cryptol. ePrint Arch. 2022: 1229 (2022) - [i35]Benoît Libert, Alain Passelègue, Mahshid Riahinia:
New and Improved Constructions for Partially Equivocable Public Key Encryption. IACR Cryptol. ePrint Arch. 2022: 1733 (2022) - 2021
- [j16]Dingding Jia, Benoît Libert:
SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions. Des. Codes Cryptogr. 89(5): 895-923 (2021) - [j15]Benoît Libert, Damien Stehlé, Radu Titiu:
Adaptively Secure Distributed PRFs from sf LWE. J. Cryptol. 34(3): 29 (2021) - [j14]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Adaptive oblivious transfer with access control from lattice assumptions. Theor. Comput. Sci. 891: 210-229 (2021) - [c87]Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung:
Bifurcated Signatures: Folding the Accountability vs. Anonymity Dilemma into a Single Private Signing Scheme. EUROCRYPT (3) 2021: 521-552 - [c86]Julien Devevey, Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung:
Non-interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings. Public Key Cryptography (1) 2021: 659-690 - [i34]Julien Devevey, Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung:
Non-Interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings. IACR Cryptol. ePrint Arch. 2021: 630 (2021) - 2020
- [j13]Benoît Libert, Moti Yung:
Adaptively Secure Non-interactive CCA-Secure Threshold Cryptosystems: Generic Framework and Constructions. J. Cryptol. 33(4): 1405-1441 (2020) - [c85]Benoît Libert, Khoa Nguyen, Alain Passelègue, Radu Titiu:
Simulation-Sound Arguments for LWE and Applications to KDM-CCA2 Security. ASIACRYPT (1) 2020: 128-158 - [c84]Amit Deo, Benoît Libert, Khoa Nguyen, Olivier Sanders:
Lattice-Based E-Cash, Revisited. ASIACRYPT (2) 2020: 318-348 - [c83]Benoît Libert, Alain Passelègue, Hoeteck Wee, David J. Wu:
New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More. EUROCRYPT (3) 2020: 410-441 - [c82]Shweta Agrawal, Benoît Libert, Monosij Maitra, Radu Titiu:
Adaptive Simulation Security for Inner Product Functional Encryption. Public Key Cryptography (1) 2020: 34-64 - [i33]Shweta Agrawal, Benoît Libert, Monosij Maitra, Radu Titiu:
Adaptive Simulation Security for Inner Product Functional Encryption. IACR Cryptol. ePrint Arch. 2020: 209 (2020) - [i32]Benoît Libert, Alain Passelègue, Hoeteck Wee, David J. Wu:
New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More. IACR Cryptol. ePrint Arch. 2020: 265 (2020) - [i31]Amit Deo, Benoît Libert, Khoa Nguyen, Olivier Sanders:
Lattice-Based E-Cash, Revisited. IACR Cryptol. ePrint Arch. 2020: 614 (2020) - [i30]Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung:
Compact Simulation-Sound NIZK Arguments of Composite Residuosity and Applications to Logarithmic-Size Ring Signatures. IACR Cryptol. ePrint Arch. 2020: 1334 (2020)
2010 – 2019
- 2019
- [j12]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption. Theor. Comput. Sci. 759: 72-97 (2019) - [c81]Benoît Libert, Radu Titiu:
Multi-Client Functional Encryption for Linear Functions in the Standard Model from LWE. ASIACRYPT (3) 2019: 520-551 - [c80]Benoît Libert, Chen Qian:
Lossy Algebraic Filters with Short Tags. Public Key Cryptography (1) 2019: 34-65 - [c79]Benoît Libert, Khoa Nguyen, Benjamin Hong Meng Tan, Huaxiong Wang:
Zero-Knowledge Elementary Databases with More Expressive Queries. Public Key Cryptography (1) 2019: 255-285 - [i29]Benoît Libert, Khoa Nguyen, Alain Passelègue, Radu Titiu:
Simulation-Sound Proofs for LWE and Applications to KDM-CCA2 Security. IACR Cryptol. ePrint Arch. 2019: 908 (2019) - 2018
- [c78]Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang:
Lattice-Based Zero-Knowledge Arguments for Integer Relations. CRYPTO (2) 2018: 700-732 - [c77]Benoît Libert, Thomas Peters, Chen Qian:
Logarithmic-Size Ring Signatures with Tight Security from the DDH Assumption. ESORICS (2) 2018: 288-308 - [c76]Junqing Gong, Benoît Libert, Somindu C. Ramanna:
Compact IBBE and Fuzzy IBE from Simple Assumptions. SCN 2018: 563-582 - [c75]Benoît Libert, Damien Stehlé, Radu Titiu:
Adaptively Secure Distributed PRFs from \mathsf LWE. TCC (2) 2018: 391-421 - [i28]Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang:
Lattice-Based Zero-Knowledge Arguments for Integer Relations. IACR Cryptol. ePrint Arch. 2018: 716 (2018) - [i27]Benoît Libert, Damien Stehlé, Radu Titiu:
Adaptively Secure Distributed PRFs from LWE. IACR Cryptol. ePrint Arch. 2018: 927 (2018) - 2017
- [j11]Fabrice Benhamouda, Javier Herranz, Marc Joye, Benoît Libert:
Efficient Cryptosystems From 2k-th Power Residue Symbols. J. Cryptol. 30(2): 519-549 (2017) - [c74]Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang:
Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash. ASIACRYPT (3) 2017: 304-335 - [c73]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Adaptive Oblivious Transfer with Access Control from Lattice Assumptions. ASIACRYPT (1) 2017: 533-563 - [c72]Benoît Libert, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE. CRYPTO (3) 2017: 332-364 - [c71]Marc Joye, Benoît Libert:
Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves. CT-RSA 2017: 19-35 - [c70]Benoît Libert, Thomas Peters, Chen Qian:
Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts. Public Key Cryptography (1) 2017: 247-276 - [i26]Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang:
Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash. IACR Cryptol. ePrint Arch. 2017: 856 (2017) - [i25]Benoît Libert, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE. IACR Cryptol. ePrint Arch. 2017: 876 (2017) - 2016
- [j10]Benoît Libert, Marc Joye, Moti Yung:
Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares. Theor. Comput. Sci. 645: 1-24 (2016) - [j9]Fabrice Benhamouda, Marc Joye, Benoît Libert:
A New Framework for Privacy-Preserving Aggregation of Time-Series Data. ACM Trans. Inf. Syst. Secur. 18(3): 10:1-10:21 (2016) - [c69]Benoît Libert, Fabrice Mouhartem, Khoa Nguyen:
A Lattice-Based Group Signature Scheme with Message-Dependent Opening. ACNS 2016: 137-155 - [c68]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption. ASIACRYPT (2) 2016: 101-131 - [c67]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions. ASIACRYPT (2) 2016: 373-403 - [c66]Benoît Libert, Fabrice Mouhartem, Thomas Peters, Moti Yung:
Practical "Signatures with Efficient Protocols" from Simple Assumptions. AsiaCCS 2016: 511-522 - [c65]Shweta Agrawal, Benoît Libert, Damien Stehlé:
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions. CRYPTO (3) 2016: 333-362 - [c64]Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang:
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors. EUROCRYPT (2) 2016: 1-31 - [c63]Benoît Libert, Somindu C. Ramanna, Moti Yung:
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions. ICALP 2016: 30:1-30:14 - [c62]Jie Chen, Benoît Libert, Somindu C. Ramanna:
Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys. SCN 2016: 23-41 - [i24]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions. IACR Cryptol. ePrint Arch. 2016: 101 (2016) - [i23]Benoît Libert, Somindu C. Ramanna, Moti Yung:
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions. IACR Cryptol. ePrint Arch. 2016: 766 (2016) - [i22]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption. IACR Cryptol. ePrint Arch. 2016: 879 (2016) - 2015
- [b2]Benoît Libert:
Applications of Structure-Preserving Cryptography and Pairing-Based NIZK Proofs. École normale supérieure de Lyon, France, 2015 - [j8]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Linearly homomorphic structure-preserving signatures and their applications. Des. Codes Cryptogr. 77(2-3): 441-477 (2015) - [c61]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Compactly Hiding Linear Spans - Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications. ASIACRYPT (1) 2015: 681-707 - [c60]Benoît Libert, Thomas Peters, Moti Yung:
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions. CRYPTO (2) 2015: 296-316 - [c59]Benoît Libert, Marc Joye, Moti Yung, Thomas Peters:
Secure Efficient History-Hiding Append-Only Signatures in the Standard Model. Public Key Cryptography 2015: 450-473 - [i21]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Compactly Hiding Linear Spans: Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications. IACR Cryptol. ePrint Arch. 2015: 242 (2015) - [i20]Benoît Libert, Damien Stehlé:
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions. IACR Cryptol. ePrint Arch. 2015: 608 (2015) - [i19]Benoît Libert, Thomas Peters, Moti Yung:
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions. IACR Cryptol. ePrint Arch. 2015: 743 (2015) - 2014
- [c58]Benoît Libert, Marc Joye, Moti Yung, Thomas Peters:
Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security. ASIACRYPT (2) 2014: 1-21 - [c57]Benoît Libert, Marc Joye:
Group Signatures with Message-Dependent Opening in the Standard Model. CT-RSA 2014: 286-306 - [c56]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures. EUROCRYPT 2014: 514-532 - [c55]Alex Escala, Javier Herranz, Benoît Libert, Carla Ràfols:
Identity-Based Lossy Trapdoor Functions: New Definitions, Hierarchical Extensions, and Implications. Public Key Cryptography 2014: 239-256 - [c54]Benoît Libert, Moti Yung, Marc Joye, Thomas Peters:
Traceable Group Encryption. Public Key Cryptography 2014: 592-610 - [c53]Benoît Libert, Marc Joye, Moti Yung:
Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. PODC 2014: 303-312 - [i18]Benoît Libert, Marc Joye, Moti Yung, Thomas Peters:
Concise Multi-Challenge CCA-Secure Encryption and Signatures with Almost Tight Security. IACR Cryptol. ePrint Arch. 2014: 743 (2014) - 2013
- [j7]Benoît Libert, Moti Yung:
Adaptively secure non-interactive threshold cryptosystems. Theor. Comput. Sci. 478: 76-100 (2013) - [c52]Fabien Laguillaumie, Adeline Langlois, Benoît Libert, Damien Stehlé:
Lattice-Based Group Signatures with Logarithmic Signature Size. ASIACRYPT (2) 2013: 41-61 - [c51]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Linearly Homomorphic Structure-Preserving Signatures and Their Applications. CRYPTO (2) 2013: 289-307 - [c50]Marc Joye, Benoît Libert:
Efficient Cryptosystems from 2 k -th Power Residue Symbols. EUROCRYPT 2013: 76-92 - [c49]Marc Joye, Benoît Libert:
A Scalable Scheme for Privacy-Preserving Aggregation of Time-Series Data. Financial Cryptography 2013: 111-125 - [c48]Pooya Farshim, Benoît Libert, Kenneth G. Paterson, Elizabeth A. Quaglia:
Robust Encryption, Revisited. Public Key Cryptography 2013: 352-368 - [c47]Nuttapong Attrapadung, Benoît Libert, Thomas Peters:
Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures. Public Key Cryptography 2013: 386-404 - [i17]Fabien Laguillaumie, Adeline Langlois, Benoît Libert, Damien Stehlé:
Lattice-Based Group Signatures with Logarithmic Signature Size. IACR Cryptol. ePrint Arch. 2013: 308 (2013) - [i16]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Linearly Homomorphic Structure-Preserving Signatures and Their Applications. IACR Cryptol. ePrint Arch. 2013: 361 (2013) - [i15]Marc Joye, Benoît Libert:
Efficient Cryptosystems From 2k-th Power Residue Symbols. IACR Cryptol. ePrint Arch. 2013: 435 (2013) - [i14]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures. IACR Cryptol. ePrint Arch. 2013: 691 (2013) - 2012
- [j6]Nuttapong Attrapadung, Benoît Libert:
Functional encryption for public-attribute inner products: Achieving constant-size ciphertexts with adaptive security or support for negation. J. Math. Cryptol. 5(2): 115-158 (2012) - [j5]Nuttapong Attrapadung, Javier Herranz, Fabien Laguillaumie, Benoît Libert, Elie de Panafieu, Carla Ràfols:
Attribute-based encryption schemes with constant-size ciphertexts. Theor. Comput. Sci. 422: 15-38 (2012) - [c46]Nuttapong Attrapadung, Benoît Libert, Thomas Peters:
Computing on Authenticated Data: New Privacy Definitions and Constructions. ASIACRYPT 2012: 367-385 - [c45]Benoît Libert, Moti Yung:
Fully Forward-Secure Group Signatures. Cryptography and Security 2012: 156-184 - [c44]Benoît Libert, Thomas Peters, Moti Yung:
Group Signatures with Almost-for-Free Revocation. CRYPTO 2012: 571-589 - [c43]Javier Herranz, Fabien Laguillaumie, Benoît Libert, Carla Ràfols:
Short Attribute-Based Signatures for Threshold Predicates. CT-RSA 2012: 51-67 - [c42]Benoît Libert, Thomas Peters, Moti Yung:
Scalable Group Signatures with Revocation. EUROCRYPT 2012: 609-627 - [c41]Malika Izabachène, Benoît Libert:
Divisible E-Cash in the Standard Model. Pairing 2012: 314-332 - [c40]Benoît Libert, Kenneth G. Paterson, Elizabeth A. Quaglia:
Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model. Public Key Cryptography 2012: 206-224 - [c39]Benoît Libert, Moti Yung:
Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions. TCC 2012: 75-93 - [i13]Alex Escala, Javier Herranz, Benoît Libert, Carla Ràfols:
Hierarchical Identity-Based Lossy Trapdoor Functions. CoRR abs/1202.5856 (2012) - [i12]Benoît Libert, Thomas Peters, Moti Yung:
Scalable Group Signatures with Revocation. IACR Cryptol. ePrint Arch. 2012: 424 (2012) - [i11]Benoît Libert, Thomas Peters, Moti Yung:
Group Signatures with Almost-for-free Revocation. IACR Cryptol. ePrint Arch. 2012: 442 (2012) - [i10]Alex Escala, Javier Herranz, Benoît Libert, Carla Ràfols:
Hierarchical Identity-Based (Lossy) Trapdoor Functions. IACR Cryptol. ePrint Arch. 2012: 503 (2012) - [i9]Pooya Farshim, Benoît Libert, Kenneth G. Paterson, Elizabeth A. Quaglia:
Robust Encryption, Revisited. IACR Cryptol. ePrint Arch. 2012: 673 (2012) - 2011
- [j4]Benoît Libert, Moti Yung:
Efficient traceable signatures in the standard model. Theor. Comput. Sci. 412(12-14): 1220-1242 (2011) - [j3]Benoît Libert, Damien Vergnaud:
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption. IEEE Trans. Inf. Theory 57(3): 1786-1802 (2011) - [j2]Benoît Libert, Damien Vergnaud:
Towards Practical Black-Box Accountable Authority IBE: Weak Black-Box Traceability With Short Ciphertexts and Private Keys. IEEE Trans. Inf. Theory 57(10): 7189-7204 (2011) - [c38]Brett Hemenway, Benoît Libert, Rafail Ostrovsky, Damien Vergnaud:
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security. ASIACRYPT 2011: 70-88 - [c37]Marc Fischlin, Benoît Libert, Mark Manulis:
Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security. ASIACRYPT 2011: 468-485 - [c36]Benoît Libert, Moti Yung:
Adaptively Secure Forward-Secure Non-interactive Threshold Cryptosystems. Inscrypt 2011: 1-21 - [c35]Benoît Libert, Moti Yung:
Adaptively Secure Non-interactive Threshold Cryptosystems. ICALP (2) 2011: 588-600 - [c34]Malika Izabachène, Benoît Libert, Damien Vergnaud:
Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes. IMACC 2011: 431-450 - [c33]Nuttapong Attrapadung, Benoît Libert:
Homomorphic Network Coding Signatures in the Standard Model. Public Key Cryptography 2011: 17-34 - [c32]Nuttapong Attrapadung, Benoît Libert, Elie de Panafieu:
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts. Public Key Cryptography 2011: 90-108 - [r2]Benoît Libert, Jean-Jacques Quisquater:
Identity-Based Cryptosystems. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 588-594 - [i8]Benoît Libert, Kenneth G. Paterson, Elizabeth A. Quaglia:
Anonymous Broadcast Encryption. IACR Cryptol. ePrint Arch. 2011: 476 (2011) - 2010
- [j1]