Fabien Laguillaumie

Orcid: 0000-0001-6464-1139

According to our database1, Fabien Laguillaumie authored at least 50 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computational Differential Privacy for Encrypted Databases Supporting Linear Queries.
Proc. Priv. Enhancing Technol., 2024

Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations.
IACR Cryptol. ePrint Arch., 2024

An Improved Threshold Homomorphic Cryptosystem Based on Class Groups.
IACR Cryptol. ePrint Arch., 2024

2023
I Want to Ride My BICYCL : BICYCL Implements CryptographY in CLass Groups.
J. Cryptol., July, 2023

Bandwidth-efficient threshold EC-DSA revisited: Online/offline extensions, identifiable aborts proactive and adaptive security.
Theor. Comput. Sci., 2023

2022
A tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency.
Theor. Comput. Sci., 2022

Threshold Linearly Homomorphic Encryption on $\mathbf{Z}/2^k\mathbf{Z}$.
IACR Cryptol. ePrint Arch., 2022

Threshold Linearly Homomorphic Encryption on bfZ/2<sup>kbfZ</sup>.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
Efficient CCA Timed Commitments in Class Groups.
IACR Cryptol. ePrint Arch., 2021

Bandwidth-efficient threshold EC-DSA revisited: Online/Offline Extensions, Identifiable Aborts, Proactivity and Adaptive Security.
IACR Cryptol. ePrint Arch., 2021

Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions.
Algorithmica, 2021

2020
Bandwidth-efficient threshold EC-DSA.
IACR Cryptol. ePrint Arch., 2020

Blind Functional Encryption.
Proceedings of the Information and Communications Security - 22nd International Conference, 2020

2019
Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations.
IACR Cryptol. ePrint Arch., 2019

2018
Practical Fully Secure Unrestricted Inner Product Functional Encryption modulo p.
IACR Cryptol. ePrint Arch., 2018

2017
Encryption Switching Protocols Revisited: Switching modulo p.
IACR Cryptol. ePrint Arch., 2017

2016
Verifiable Message-Locked Encryption.
Proceedings of the Cryptology and Network Security - 15th International Conference, 2016

2015
Linearly Homomorphic Encryption from DDH.
IACR Cryptol. ePrint Arch., 2015

Linearly Homomorphic Encryption from $$\mathsf {DDH}$$.
Proceedings of the Topics in Cryptology, 2015

Implementing Candidate Graded Encoding Schemes from Ideal Lattices.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Improved Parameters and an Implementation of Graded Encoding Schemes from Ideal Lattices.
IACR Cryptol. ePrint Arch., 2014

Proxy Re-Encryption Scheme Supporting a Selection of Delegatees.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2014, 2014

2013
Lattice-Based Group Signatures with Logarithmic Signature Size.
IACR Cryptol. ePrint Arch., 2013

2012
Attribute-based encryption schemes with constant-size ciphertexts.
Theor. Comput. Sci., 2012

Homomorphic Encryption for Multiplications and Pairing Evaluation.
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

Short Attribute-Based Signatures for Threshold Predicates.
Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

Plaintext-Checkable Encryption.
Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

2011
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory.
IEEE Trans. Inf. Theory, 2011

Improving the Security of an Efficient Unidirectional Proxy Re-Encryption Scheme.
J. Internet Serv. Inf. Secur., 2011

Relations between semantic security and anonymity in identity-based encryption.
Inf. Process. Lett., 2011

Public-Key Cryptography: Design and Algorithmic. (Cryptographie à clé publique: Conception et algorithmique).
, 2011

2010
Time-selective convertible undeniable signatures with short conversion receipts.
Inf. Sci., 2010

Constant Size Ciphertexts in Threshold Attribute-Based Encryption.
Proceedings of the Public Key Cryptography, 2010

A Variant of Miller's Formula and Algorithm.
Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

2009
Fair E-Cash: Be Compact, Spend Faster.
Proceedings of the Information Security, 12th International Conference, 2009

On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis.
Proceedings of the Advances in Cryptology, 2009

Factoring <i>pq</i><sup>2</sup> with Quadratic Forms: Nice Cryptanalyses.
Proceedings of the Advances in Cryptology, 2009

2008
TrapdoorSanitizable Signatures and Their Application to Content Protection.
Proceedings of the Applied Cryptography and Network Security, 6th International Conference, 2008

2007
Multi-designated verifiers signatures: anonymity without encryption.
Inf. Process. Lett., 2007

Aggregate designated verifier signatures and application to secure routing.
Int. J. Secur. Networks, 2007

On the Soundness of Restricted Universal Designated Verifier Signatures and Dedicated Signatures.
Proceedings of the Information Security, 10th International Conference, 2007

2006
Universal Designated Verifier Signatures Without Random Oracles or Non-black Box Assumptions.
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

Blind Ring Signatures Secure Under the Chosen-Target-CDH Assumption.
Proceedings of the Information Security, 9th International Conference, 2006

Efficient Authentication for Reactive Routing Protocols.
Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006

2005
Short Undeniable Signatures Without Random Oracles: The Missing Link.
Proceedings of the Progress in Cryptology, 2005

Time-Selective Convertible Undeniable Signatures.
Proceedings of the Topics in Cryptology, 2005

Universally Convertible Directed Signatures.
Proceedings of the Advances in Cryptology, 2005

2004
Universal forgery on Sekhar's signature scheme with message recovery.
Int. J. Comput. Math., 2004

Designated Verifier Signatures: Anonymity and Efficient Construction from Any Bilinear Map.
Proceedings of the Security in Communication Networks, 4th International Conference, 2004

Multi-designated Verifiers Signatures.
Proceedings of the Information and Communications Security, 6th International Conference, 2004


  Loading...