( en | de | ru )

 

Disambiguation of "Fehr, Serge"

Author of the publication

copydeleteadd this publication to your clipboard
Quantum Authentication and Encryption with Key Recycling - Or: How to Re-use a One-Time Pad Even if P=NP - Safely & Feasibly.

, and . EUROCRYPT (3), volume 10212 of Lecture Notes in Computer Science, page 311-338. (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Elena Sergeyev

Nikolai Sergeev

Tatiana Sergey

Dieter Sergel

Jean-Frédéric Sergejew

 

Other publications of authors with the same name

Quantum Authentication and Encryption with Key Recycling., and . IACR Cryptology ePrint Archive, (2017)The Measure-and-Reprogram Technique 2.0: Multi-round Fiat-Shamir and More., , and . CRYPTO (3), volume 12172 of Lecture Notes in Computer Science, page 602-631. Springer, (2020)On the Parallel Repetition of Multi-Player Games: The No-Signaling Case., , and . TQC, volume 27 of LIPIcs, page 24-35. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Adaptive Versus Static Multi-oracle Algorithms, and Quantum Security of a Split-Key PRF., , and . TCC (1), volume 13747 of Lecture Notes in Computer Science, page 33-51. Springer, (2022)Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments., , and . ASIACRYPT, volume 2501 of Lecture Notes in Computer Science, page 206-223. Springer, (2002)One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games., , , and . EUROCRYPT, volume 7881 of Lecture Notes in Computer Science, page 609-625. Springer, (2013)Unfair Noisy Channels and Oblivious Transfer., , , and . TCC, volume 2951 of Lecture Notes in Computer Science, page 355-373. Springer, (2004)Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary., and . EUROCRYPT (3), volume 11478 of Lecture Notes in Computer Science, page 472-499. Springer, (2019)The garden-hose model., , , and . ITCS, page 145-158. ACM, (2013)Compressing Proofs of k-Out-Of-n Partial Knowledge., , and . CRYPTO (4), volume 12828 of Lecture Notes in Computer Science, page 65-91. Springer, (2021)