Serge Fehr

According to our database1, Serge Fehr authored at least 74 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hide-and-Seek and the Non-Resignability of the BUFF Transform.
IACR Cryptol. ePrint Arch., 2024

2023
Fiat-Shamir Transformation of Multi-Round Interactive Proofs (Extended Version).
J. Cryptol., October, 2023

On the Quantum Security of HAWK.
IACR Cryptol. ePrint Arch., 2023

On Fully-Secure Honest Majority MPC without n<sup>2</sup> Round Overhead.
IACR Cryptol. ePrint Arch., 2023

On the (In)Security of the BUFF Transform.
IACR Cryptol. ePrint Arch., 2023

Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium.
IACR Cryptol. ePrint Arch., 2023

A Generalized Special-Soundness Notion and its Knowledge Extractors.
IACR Cryptol. ePrint Arch., 2023

The Fiat-Shamir Transformation of (Γ<sub>1,đots,Γ<sub>μ)</sub></sub>-Special-Sound Interactive Proofs.
IACR Cryptol. ePrint Arch., 2023

Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment.
J. Medical Syst., 2022

Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM.
IACR Cryptol. ePrint Arch., 2022

Adaptive versus Static Multi-oracle Algorithms, and Quantum Security of a Split-key PRF.
IACR Cryptol. ePrint Arch., 2022

Parallel Repetition of (k<sub>1, đots</sub> , k<sub>μ </sub>)-Special-Sound Multi-round Interactive Proofs.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Online-Extractability in the Quantum Random-Oracle Model.
IACR Cryptol. ePrint Arch., 2021

Fiat-Shamir Transformation of Multi-Round Interactive Proofs.
IACR Cryptol. ePrint Arch., 2021

Parallel Repetition of (k<sub>1, đots, k<sub>μ</sub>)</sub>-Special-Sound Multi-Round Interactive Proofs.
IACR Cryptol. ePrint Arch., 2021

2020
The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More.
IACR Cryptol. ePrint Arch., 2020

On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work.
IACR Cryptol. ePrint Arch., 2020

Compressing Proofs of k-Out-Of-n Partial Knowledge.
IACR Cryptol. ePrint Arch., 2020

Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples.
Proceedings of the Advances in Information and Computer Security, 2020

2019
Robust Secret Sharing with Optimal Share Size and Security Against Rushing Adversaries.
IACR Cryptol. ePrint Arch., 2019

Towards optimal robust secret sharing with security against a rushing adversary.
IACR Cryptol. ePrint Arch., 2019

Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model.
IACR Cryptol. ePrint Arch., 2019

On the Quantum Complexity of the Continuous Hidden Subgroup Problem.
IACR Cryptol. ePrint Arch., 2019

2018
Short Non-Malleable Codes from Related-Key Secure Block Ciphers.
IACR Trans. Symmetric Cryptol., 2018

Classical Proofs for the Quantum Collapsing Property of Classical Hash Functions.
IACR Cryptol. ePrint Arch., 2018

Secure Certification of Mixed Quantum States with Application to Two-Party Randomness Generation.
IACR Cryptol. ePrint Arch., 2018

From Classical to Quantum Information - Or: When You Have Less Than No Uncertainty.
ERCIM News, 2018

2017
Quantum Authentication and Encryption with Key Recycling.
IACR Cryptol. ePrint Arch., 2017

Quantum Authentication and Encryption with Key Recycling - Or: How to Re-use a One-Time Pad Even if P=NP - Safely & Feasibly.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
On the Composition of Two-Prover Commitments, and Applications to Multi-Round Relativistic Commitments.
IACR Cryptol. ePrint Arch., 2016

Cheater Detection in SPDZ Multiparty Computation.
Proceedings of the Information Theoretic Security - 9th International Conference, 2016

Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
One-Sided Device-Independent QKD and Position-based Cryptography from Monogamy Games.
IACR Cryptol. ePrint Arch., 2015

Feasibility and Completeness of Cryptographic Tasks in the Quantum World.
IACR Cryptol. ePrint Arch., 2015

Multi-Prover Commitments Against Non-Signaling Attacks.
IACR Cryptol. ePrint Arch., 2015

Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions.
IACR Cryptol. ePrint Arch., 2015

2014
On the Conditional Rényi Entropy.
IEEE Trans. Inf. Theory, 2014

Secure identification and QKD in the bounded-quantum-storage model.
Theor. Comput. Sci., 2014

Position-Based Quantum Cryptography: Impossibility and Constructions.
SIAM J. Comput., 2014

On the Parallel Repetition of Multi-Player Games: The No-Signaling Case.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

2013
Quantum Cryptanalysis (Dagstuhl Seminar 13371).
Dagstuhl Reports, 2013

On quantum Renyi entropies: a new definition and some properties.
CoRR, 2013

The garden-hose model.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
An All-But-One Entropic Uncertainty Relation, and Application to Password-Based Identification.
Proceedings of the Theory of Quantum Computation, 2012

Unconditionally-Secure Robust Secret Sharing with Compact Shares.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011
Secure Authentication from a Weak Key, Without Leaking Information.
IACR Cryptol. ePrint Arch., 2011

Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority.
IACR Cryptol. ePrint Arch., 2011

Position-Based Quantum Cryptography.
ERCIM News, 2011

Quantum Cryptanalysis (Dagstuhl Seminar 11381).
Dagstuhl Reports, 2011

Security and Composability of Randomness Expansion from Bell Inequalities
CoRR, 2011

The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography
CoRR, 2011

2010
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Sampling in a Quantum Population, and Applications.
Proceedings of the Advances in Cryptology, 2010

2009
Composing Quantum Protocols in a Classical Environment.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Improving the Security of Quantum Protocols via Commit-and-Open.
Proceedings of the Advances in Cryptology, 2009

2008
Cryptography in the Bounded-Quantum-Storage Model.
SIAM J. Comput., 2008

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.
IACR Cryptol. ePrint Arch., 2008

On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles.
IACR Cryptol. ePrint Arch., 2008

Randomness Extraction Via <i>delta</i> -Biased Masking in the Presence of a Quantum Attacker.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2007
Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker.
IACR Cryptol. ePrint Arch., 2007

A Tight High-Order Entropic Quantum Uncertainty Relation With Applications.
IACR Cryptol. ePrint Arch., 2007

2006
Perfect NIZK with Adaptive Soundness.
IACR Cryptol. ePrint Arch., 2006

2005
Oblivious Transfer and Linear Functions.
IACR Cryptol. ePrint Arch., 2005

Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields.
Proceedings of the Advances in Cryptology, 2005

2004
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography.
IACR Cryptol. ePrint Arch., 2004

Unfair Noisy Channels and Oblivious Transfer.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks.
Proceedings of the Advances in Cryptology, 2004

2003
Efficient Multi-Party Computation over Rings.
IACR Cryptol. ePrint Arch., 2003

2002
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups.
IACR Cryptol. ePrint Arch., 2002

Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks.
Proceedings of the Advances in Cryptology, 2002

Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments.
Proceedings of the Advances in Cryptology, 2002

2001
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase.
Proceedings of the Advances in Cryptology, 2001


  Loading...