Céline Chevalier

Orcid: 0009-0006-4231-4958

According to our database1, Céline Chevalier authored at least 49 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Shorter and Faster Identity-Based Signatures with Tight Security in the (Q)ROM from Lattices.
IACR Cryptol. ePrint Arch., 2023

Quarantined-TreeKEM: a Continuous Group Key Agreement for MLS, Secure in Presence of Inactive Users.
IACR Cryptol. ePrint Arch., 2023

Leaking-cascades: an optimized construction for KEM hybridization.
IACR Cryptol. ePrint Arch., 2023

Unclonable Cryptography in the Plain Model.
IACR Cryptol. ePrint Arch., 2023

Semi-Quantum Copy-Protection and More.
IACR Cryptol. ePrint Arch., 2023

Practical Construction for Secure Trick-Taking Games Even With Cards Set Aside.
IACR Cryptol. ePrint Arch., 2023

GeT a CAKE: Generic Transformations from Key Encaspulation Mechanisms to Password Authenticated Key Exchanges.
IACR Cryptol. ePrint Arch., 2023

On Quantum Simulation-Soundness.
IACR Cryptol. ePrint Arch., 2023

Formal Verification of a Post-quantum Signal Protocol with Tamarin.
Proceedings of the Verification and Evaluation of Computer and Communication Systems, 2023

Efficient Implementation of a Post-Quantum Anonymous Credential Protocol.
Proceedings of the 18th International Conference on Availability, Reliability and Security, 2023

2022
Embedding the UC Model into the IITM Model.
IACR Cryptol. ePrint Arch., 2022

Correction to: Dispelling myths on superposition attacks: formal security model and attack analyses.
Des. Codes Cryptogr., 2022

Dispelling myths on superposition attacks: formal security model and attack analyses.
Des. Codes Cryptogr., 2022

2021
Hardware security without secure hardware: How to decrypt with a password and a server.
Theor. Comput. Sci., 2021

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

2020
Superposition Attack on OT Protocols.
IACR Cryptol. ePrint Arch., 2020

On the Security Notions for Encryption in a Quantum World.
IACR Cryptol. ePrint Arch., 2020

Converting networks to predictive logic models from perturbation signalling data with CellNOpt.
Bioinform., 2020

Round-optimal Constant-size Blind Signatures.
Proceedings of the 17th International Joint Conference on e-Business and Telecommunications, 2020

2019
Post-Quantum UC-Secure Oblivious Transfer in the Standard Model with Adaptive Corruptions.
IACR Cryptol. ePrint Arch., 2019

On the Everlasting Security of Password-Authenticated Quantum Key Exchange.
CoRR, 2019

2018
Spreading Alerts Quietly: New Insights from Theory and Practice.
Proceedings of the 13th International Conference on Availability, Reliability and Security, 2018

Non-Interactive Key Exchange from Identity-Based Encryption.
Proceedings of the 13th International Conference on Availability, Reliability and Security, 2018

2017
Almost Optimal Oblivious Transfer from QA-NIZK.
IACR Cryptol. ePrint Arch., 2017

2016
Adaptive Oblivious Transfer and Generalizations.
IACR Cryptol. ePrint Arch., 2016

Structure-Preserving Smooth Projective Hashing.
IACR Cryptol. ePrint Arch., 2016

Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness.
IACR Cryptol. ePrint Arch., 2016

How to (Carefully) Breach a Service Contract?
Proceedings of the New Codebreakers, 2016

Adaptive Oblivious Transfer and Generalization.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Mitigating Server Breaches in Password-Based Authentication: Secure and Efficient Solutions.
IACR Cryptol. ePrint Arch., 2015

Non-Interactive Zero-Knowledge Proofs of Non-Membership.
IACR Cryptol. ePrint Arch., 2015

Generic Construction of UC-Secure Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2015

New Techniques for SPHFs and Efficient One-Round PAKE Protocols.
IACR Cryptol. ePrint Arch., 2015

2013
New Smooth Projective Hash Functions and One-Round Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2013

Analysis and Improvement of Lindell's UC-Secure Commitment Schemes.
IACR Cryptol. ePrint Arch., 2013

SPHF-Friendly Non-Interactive Commitments.
IACR Cryptol. ePrint Arch., 2013

Composition of password-based protocols.
Formal Methods Syst. Des., 2013

Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

2012
Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages.
IACR Cryptol. ePrint Arch., 2012

2011
Vaudenay's Privacy Model in the Universal Composability Framework: A Case Study.
Proceedings of the Secure and Trust Computing, Data Management, and Applications, 2011

Transforming Password Protocols to Compose.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Contributory Password-Authenticated Group Key Exchange with Join Capability.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

2010
Strong Cryptography from Weak Secrets.
Proceedings of the Progress in Cryptology, 2010

Flexible Group Key Exchange with On-demand Computation of Subgroup Keys.
Proceedings of the Progress in Cryptology, 2010

2009
Distributed Public-Key Cryptography from Weak Secrets.
Proceedings of the Public Key Cryptography, 2009

Optimal Randomness Extraction from a Diffie-Hellman Element.
Proceedings of the Advances in Cryptology, 2009

Smooth Projective Hashing for Conditionally Extractable Commitments.
Proceedings of the Advances in Cryptology, 2009

Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness.
Proceedings of the Progress in Cryptology, 2009

2008
Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework.
Proceedings of the Topics in Cryptology, 2008


  Loading...