default search action
Serge Fehr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c58]Jelle Don, Serge Fehr, Yu-Hsuan Huang, Patrick Struck:
On the (In)Security of the BUFF Transform. CRYPTO (1) 2024: 246-275 - [c57]Jelle Don, Serge Fehr, Yu-Hsuan Huang, Jyun-Jie Liao, Patrick Struck:
Hide-and-Seek and the Non-resignability of the BUFF Transform. TCC (3) 2024: 347-370 - [i61]Jelle Don, Serge Fehr, Yu-Hsuan Huang, Jyun-Jie Liao, Patrick Struck:
Hide-and-Seek and the Non-Resignability of the BUFF Transform. IACR Cryptol. ePrint Arch. 2024: 793 (2024) - 2023
- [j7]Thomas Attema, Serge Fehr, Michael Klooß:
Fiat-Shamir Transformation of Multi-Round Interactive Proofs (Extended Version). J. Cryptol. 36(4): 36 (2023) - [c56]Manuel Barbosa, Gilles Barthe, Christian Doczkal, Jelle Don, Serge Fehr, Benjamin Grégoire, Yu-Hsuan Huang, Andreas Hülsing, Yi Lee, Xiaodi Wu:
Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium. CRYPTO (5) 2023: 358-389 - [c55]Daniel Escudero, Serge Fehr:
On Fully-Secure Honest Majority MPC Without n2 Round Overhead. LATINCRYPT 2023: 47-66 - [c54]Serge Fehr, Yu-Hsuan Huang:
On the Quantum Security of HAWK. PQCrypto 2023: 405-416 - [c53]Thomas Attema, Serge Fehr, Nicolas Resch:
Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness. TCC (3) 2023: 424-454 - [i60]Manuel Barbosa, Gilles Barthe, Christian Doczkal, Jelle Don, Serge Fehr, Benjamin Grégoire, Yu-Hsuan Huang, Andreas Hülsing, Yi Lee, Xiaodi Wu:
Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium. IACR Cryptol. ePrint Arch. 2023: 246 (2023) - [i59]Serge Fehr, Yu-Hsuan Huang:
On the Quantum Security of HAWK. IACR Cryptol. ePrint Arch. 2023: 711 (2023) - [i58]Thomas Attema, Serge Fehr, Nicolas Resch:
A Generalized Special-Soundness Notion and its Knowledge Extractors. IACR Cryptol. ePrint Arch. 2023: 818 (2023) - [i57]Daniel Escudero, Serge Fehr:
On Fully-Secure Honest Majority MPC without n2 Round Overhead. IACR Cryptol. ePrint Arch. 2023: 1204 (2023) - [i56]Jelle Don, Serge Fehr, Yu-Hsuan Huang, Patrick Struck:
On the (In)Security of the BUFF Transform. IACR Cryptol. ePrint Arch. 2023: 1634 (2023) - [i55]Thomas Attema, Serge Fehr, Michael Klooß, Nicolas Resch:
The Fiat-Shamir Transformation of (Γ1,đots,Γμ)-Special-Sound Interactive Proofs. IACR Cryptol. ePrint Arch. 2023: 1945 (2023) - 2022
- [j6]Gabriele Spini, Emiliano Mancini, Thomas Attema, Mark Abspoel, Jan de Gier, Serge Fehr, Thijs Veugen, Maran van Heesch, Daniël Worm, Andrea De Luca, Ronald Cramer, Peter M. A. Sloot:
New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment. J. Medical Syst. 46(12): 84 (2022) - [c52]Thomas Attema, Serge Fehr:
Parallel Repetition of (k1, đots , kμ )-Special-Sound Multi-round Interactive Proofs. CRYPTO (1) 2022: 415-443 - [c51]Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner:
Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM. CRYPTO (2) 2022: 729-757 - [c50]Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner:
Online-Extractability in the Quantum Random-Oracle Model. EUROCRYPT (3) 2022: 677-706 - [c49]Jelle Don, Serge Fehr, Yu-Hsuan Huang:
Adaptive Versus Static Multi-oracle Algorithms, and Quantum Security of a Split-Key PRF. TCC (1) 2022: 33-51 - [c48]Thomas Attema, Serge Fehr, Michael Klooß:
Fiat-Shamir Transformation of Multi-round Interactive Proofs. TCC (1) 2022: 113-142 - [i54]Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner:
Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM. CoRR abs/2202.13730 (2022) - [i53]Jelle Don, Serge Fehr, Yu-Hsuan Huang:
Adaptive versus Static Multi-oracle Algorithms, and Quantum Security of a Split-key PRF. CoRR abs/2206.08132 (2022) - [i52]Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner:
Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM. IACR Cryptol. ePrint Arch. 2022: 270 (2022) - [i51]Jelle Don, Serge Fehr, Yu-Hsuan Huang:
Adaptive versus Static Multi-oracle Algorithms, and Quantum Security of a Split-key PRF. IACR Cryptol. ePrint Arch. 2022: 773 (2022) - 2021
- [c47]Thomas Attema, Ronald Cramer, Serge Fehr:
Compressing Proofs of k-Out-Of-n Partial Knowledge. CRYPTO (4) 2021: 65-91 - [c46]Kai-Min Chung, Serge Fehr, Yu-Hsuan Huang, Tai-Ning Liao:
On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work. EUROCRYPT (2) 2021: 598-629 - [i50]Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner:
Online-Extractability in the Quantum Random-Oracle Model. CoRR abs/2103.03085 (2021) - [i49]Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner:
Online-Extractability in the Quantum Random-Oracle Model. IACR Cryptol. ePrint Arch. 2021: 280 (2021) - [i48]Thomas Attema, Serge Fehr:
Parallel Repetition of (k1, đots, kμ)-Special-Sound Multi-Round Interactive Proofs. IACR Cryptol. ePrint Arch. 2021: 1259 (2021) - [i47]Thomas Attema, Serge Fehr, Michael Klooß:
Fiat-Shamir Transformation of Multi-Round Interactive Proofs. IACR Cryptol. ePrint Arch. 2021: 1377 (2021) - 2020
- [c45]Jelle Don, Serge Fehr, Christian Majenz:
The Measure-and-Reprogram Technique 2.0: Multi-round Fiat-Shamir and More. CRYPTO (3) 2020: 602-631 - [c44]Koen de Boer, Léo Ducas, Serge Fehr:
On the Quantum Complexity of the Continuous Hidden Subgroup Problem. EUROCRYPT (2) 2020: 341-370 - [c43]Serge Fehr, Serge Vaudenay:
Sublinear Bounds on the Distinguishing Advantage for Multiple Samples. IWSEC 2020: 165-183 - [c42]Serge Fehr, Chen Yuan:
Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries. TCC (3) 2020: 470-498 - [i46]Jelle Don, Serge Fehr, Christian Majenz:
The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More. CoRR abs/2003.05207 (2020) - [i45]Kai-Min Chung, Serge Fehr, Yu-Hsuan Huang, Tai-Ning Liao:
On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work. CoRR abs/2010.11658 (2020) - [i44]Jelle Don, Serge Fehr, Christian Majenz:
The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More. IACR Cryptol. ePrint Arch. 2020: 282 (2020) - [i43]Thomas Attema, Ronald Cramer, Serge Fehr:
Compressing Proofs of k-Out-Of-n Partial Knowledge. IACR Cryptol. ePrint Arch. 2020: 753 (2020) - [i42]Kai-Min Chung, Serge Fehr, Yu-Hsuan Huang, Tai-Ning Liao:
On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work. IACR Cryptol. ePrint Arch. 2020: 1305 (2020)
2010 – 2019
- 2019
- [c41]Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner:
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model. CRYPTO (2) 2019: 356-383 - [c40]Serge Fehr, Chen Yuan:
Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary. EUROCRYPT (3) 2019: 472-499 - [i41]Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner:
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model. CoRR abs/1902.07556 (2019) - [i40]Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner:
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model. IACR Cryptol. ePrint Arch. 2019: 190 (2019) - [i39]Serge Fehr, Chen Yuan:
Towards optimal robust secret sharing with security against a rushing adversary. IACR Cryptol. ePrint Arch. 2019: 246 (2019) - [i38]Koen de Boer, Léo Ducas, Serge Fehr:
On the Quantum Complexity of the Continuous Hidden Subgroup Problem. IACR Cryptol. ePrint Arch. 2019: 716 (2019) - [i37]Serge Fehr, Chen Yuan:
Robust Secret Sharing with Optimal Share Size and Security Against Rushing Adversaries. IACR Cryptol. ePrint Arch. 2019: 1182 (2019) - 2018
- [j5]Serge Fehr, Pierre Karpman, Bart Mennink:
Short Non-Malleable Codes from Related-Key Secure Block Ciphers. IACR Trans. Symmetric Cryptol. 2018(1): 336-352 (2018) - [c39]Frédéric Dupuis, Serge Fehr, Philippe Lamontagne, Louis Salvail:
Secure Certification of Mixed Quantum States with Application to Two-Party Randomness Generation. TCC (2) 2018: 282-314 - [c38]Serge Fehr:
Classical Proofs for the Quantum Collapsing Property of Classical Hash Functions. TCC (2) 2018: 315-338 - [i36]Thomas Attema, Emiliano Mancini, Gabriele Spini, Mark Abspoel, Jan de Gier, Serge Fehr, Thijs Veugen, Maran van Heesch, Daniël Worm, Andrea De Luca, Ronald Cramer, Peter M. A. Sloot:
A New Approach to Privacy-Preserving Clinical Decision Support Systems for HIV Treatment. CoRR abs/1810.01107 (2018) - [i35]Serge Fehr:
From Classical to Quantum Information - Or: When You Have Less Than No Uncertainty. ERCIM News 2018(112) (2018) - [i34]Serge Fehr, Pierre Karpman, Bart Mennink:
Short Non-Malleable Codes from Related-Key Secure Block Ciphers. IACR Cryptol. ePrint Arch. 2018: 204 (2018) - [i33]Serge Fehr:
Classical Proofs for the Quantum Collapsing Property of Classical Hash Functions. IACR Cryptol. ePrint Arch. 2018: 887 (2018) - [i32]Frédéric Dupuis, Serge Fehr, Philippe Lamontagne, Louis Salvail:
Secure Certification of Mixed Quantum States with Application to Two-Party Randomness Generation. IACR Cryptol. ePrint Arch. 2018: 910 (2018) - 2017
- [c37]Serge Fehr, Louis Salvail:
Quantum Authentication and Encryption with Key Recycling - Or: How to Re-use a One-Time Pad Even if P=NP - Safely & Feasibly. EUROCRYPT (3) 2017: 311-338 - [e3]Serge Fehr:
Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part I. Lecture Notes in Computer Science 10174, Springer 2017, ISBN 978-3-662-54364-1 [contents] - [e2]Serge Fehr:
Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10175, Springer 2017, ISBN 978-3-662-54387-0 [contents] - [i31]Serge Fehr, Louis Salvail:
Quantum Authentication and Encryption with Key Recycling. IACR Cryptol. ePrint Arch. 2017: 102 (2017) - 2016
- [c36]Frédéric Dupuis, Serge Fehr, Philippe Lamontagne, Louis Salvail:
Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications. CRYPTO (3) 2016: 33-59 - [c35]Serge Fehr, Max Fillinger:
On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments. EUROCRYPT (2) 2016: 477-496 - [c34]Gabriele Spini, Serge Fehr:
Cheater Detection in SPDZ Multiparty Computation. ICITS 2016: 151-176 - [i30]Frédéric Dupuis, Serge Fehr, Philippe Lamontagne, Louis Salvail:
Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications. CoRR abs/1607.08168 (2016) - [i29]Serge Fehr, Max Fillinger:
On the Composition of Two-Prover Commitments, and Applications to Multi-Round Relativistic Commitments. IACR Cryptol. ePrint Arch. 2016: 113 (2016) - 2015
- [c33]Serge Fehr, Max Fillinger:
Multi-prover Commitments Against Non-signaling Attacks. CRYPTO (2) 2015: 403-421 - [c32]Ronald Cramer, Ivan Bjerre Damgård, Nico Döttling, Serge Fehr, Gabriele Spini:
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions. EUROCRYPT (2) 2015: 313-336 - [i28]Marco Tomamichel, Serge Fehr, Jedrzej Kaniewski, Stephanie Wehner:
One-Sided Device-Independent QKD and Position-based Cryptography from Monogamy Games. IACR Cryptol. ePrint Arch. 2015: 277 (2015) - [i27]Serge Fehr, Jonathan Katz, Fang Song, Hong-Sheng Zhou, Vassilis Zikas:
Feasibility and Completeness of Cryptographic Tasks in the Quantum World. IACR Cryptol. ePrint Arch. 2015: 385 (2015) - [i26]Serge Fehr, Max Fillinger:
Multi-Prover Commitments Against Non-Signaling Attacks. IACR Cryptol. ePrint Arch. 2015: 501 (2015) - [i25]Ronald Cramer, Ivan Bjerre Damgård, Nico Döttling, Serge Fehr, Gabriele Spini:
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions. IACR Cryptol. ePrint Arch. 2015: 1089 (2015) - 2014
- [j4]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. SIAM J. Comput. 43(1): 150-178 (2014) - [j3]Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Secure identification and QKD in the bounded-quantum-storage model. Theor. Comput. Sci. 560: 12-26 (2014) - [j2]Serge Fehr, Stefan Berens:
On the Conditional Rényi Entropy. IEEE Trans. Inf. Theory 60(11): 6801-6810 (2014) - [c31]Harry Buhrman, Serge Fehr, Christian Schaffner:
On the Parallel Repetition of Multi-Player Games: The No-Signaling Case. TQC 2014: 24-35 - 2013
- [c30]Marco Tomamichel, Serge Fehr, Jedrzej Kaniewski, Stephanie Wehner:
One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games. EUROCRYPT 2013: 609-625 - [c29]Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman:
The garden-hose model. ITCS 2013: 145-158 - [c28]Serge Fehr, Jonathan Katz, Fang Song, Hong-Sheng Zhou, Vassilis Zikas:
Feasibility and Completeness of Cryptographic Tasks in the Quantum World. TCC 2013: 281-296 - [i24]Martin Müller-Lennert, Frédéric Dupuis, Oleg Szehr, Serge Fehr, Marco Tomamichel:
On quantum Renyi entropies: a new definition and some properties. CoRR abs/1306.3142 (2013) - [i23]Serge Fehr, Michele Mosca, Martin Rötteler, Rainer Steinwandt:
Quantum Cryptanalysis (Dagstuhl Seminar 13371). Dagstuhl Reports 3(9): 59-73 (2013) - 2012
- [c27]Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky:
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. CRYPTO 2012: 663-680 - [c26]Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky, Yuval Rabani:
Unconditionally-Secure Robust Secret Sharing with Compact Shares. EUROCRYPT 2012: 195-208 - [c25]Niek J. Bouman, Serge Fehr, Carlos González-Guillén, Christian Schaffner:
An All-But-One Entropic Uncertainty Relation, and Application to Password-Based Identification. TQC 2012: 29-44 - 2011
- [c24]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. CRYPTO 2011: 429-446 - [c23]Niek J. Bouman, Serge Fehr:
Secure Authentication from a Weak Key, without Leaking Information. EUROCRYPT 2011: 246-265 - [e1]Serge Fehr:
Information Theoretic Security - 5th International Conference, ICITS 2011, Amsterdam, The Netherlands, May 21-24, 2011. Proceedings. Lecture Notes in Computer Science 6673, Springer 2011, ISBN 978-3-642-20727-3 [contents] - [i22]Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman:
The Garden-Hose Game: A New Model of Computation, and Application to Position-Based Quantum Cryptography. CoRR abs/1109.2563 (2011) - [i21]Serge Fehr, Ran Gelles, Christian Schaffner:
Security and Composability of Randomness Expansion from Bell Inequalities. CoRR abs/1111.6052 (2011) - [i20]Serge Fehr, Michele Mosca, Martin Rötteler, Rainer Steinwandt:
Quantum Cryptanalysis (Dagstuhl Seminar 11381). Dagstuhl Reports 1(9): 58-75 (2011) - [i19]Harry Buhrman, Serge Fehr, Christian Schaffner:
Position-Based Quantum Cryptography. ERCIM News 2011(85): 16-17 (2011) - [i18]Niek J. Bouman, Serge Fehr:
Secure Authentication from a Weak Key, Without Leaking Information. IACR Cryptol. ePrint Arch. 2011: 34 (2011) - [i17]Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky:
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. IACR Cryptol. ePrint Arch. 2011: 629 (2011) - 2010
- [c22]Niek J. Bouman, Serge Fehr:
Sampling in a Quantum Population, and Applications. CRYPTO 2010: 724-741 - [c21]Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee:
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks. EUROCRYPT 2010: 381-402 - [i16]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. CoRR abs/1009.2490 (2010) - [i15]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. IACR Cryptol. ePrint Arch. 2010: 275 (2010)
2000 – 2009
- 2009
- [c20]Ivan Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, Christian Schaffner:
Improving the Security of Quantum Protocols via Commit-and-Open. CRYPTO 2009: 408-427 - [c19]Serge Fehr, Christian Schaffner:
Composing Quantum Protocols in a Classical Environment. TCC 2009: 350-367 - 2008
- [j1]Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Cryptography in the Bounded-Quantum-Storage Model. SIAM J. Comput. 37(6): 1865-1890 (2008) - [c18]Alexandra Boldyreva, Serge Fehr, Adam O'Neill:
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles. CRYPTO 2008: 335-359 - [c17]Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. EUROCRYPT 2008: 471-488 - [c16]Serge Fehr, Christian Schaffner:
Randomness Extraction Via delta -Biased Masking in the Presence of a Quantum Attacker. TCC 2008: 465-481 - [i14]Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. IACR Cryptol. ePrint Arch. 2008: 30 (2008) - [i13]Alexandra Boldyreva, Serge Fehr, Adam O'Neill:
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles. IACR Cryptol. ePrint Arch. 2008: 352 (2008) - 2007
- [c15]Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Secure Identification and QKD in the Bounded-Quantum-Storage Model. CRYPTO 2007: 342-359 - [c14]Ivan Damgård, Serge Fehr, Renato Renner, Louis Salvail, Christian Schaffner:
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications. CRYPTO 2007: 360-378 - [c13]Masayuki Abe, Serge Fehr:
Perfect NIZK with Adaptive Soundness. TCC 2007: 118-136 - [i12]Serge Fehr, Christian Schaffner:
Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker. CoRR abs/0706.2606 (2007) - [i11]Serge Fehr, Christian Schaffner:
Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker. IACR Cryptol. ePrint Arch. 2007: 249 (2007) - [i10]Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Secure Identification and QKD in the Bounded-Quantum-Storage Model. IACR Cryptol. ePrint Arch. 2007: 327 (2007) - [i9]Ivan Damgård, Serge Fehr, Renato Renner, Louis Salvail, Christian Schaffner:
A Tight High-Order Entropic Quantum Uncertainty Relation With Applications. IACR Cryptol. ePrint Arch. 2007: 328 (2007) - 2006
- [c12]Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Oblivious Transfer and Linear Functions. CRYPTO 2006: 427-444 - [i8]Ivan Damgård, Serge Fehr, Renato Renner, Louis Salvail, Christian Schaffner:
A Tight High-Order Entropic Quantum Uncertainty Relation With Applications. CoRR abs/quant-ph/0612014 (2006) - [i7]Masayuki Abe, Serge Fehr:
Perfect NIZK with Adaptive Soundness. IACR Cryptol. ePrint Arch. 2006: 423 (2006) - 2005
- [c11]Ronald Cramer, Serge Fehr, Martijn Stam:
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields. CRYPTO 2005: 344-360 - [c10]Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Cryptography In the Bounded Quantum-Storage Model. FOCS 2005: 449-458 - [c9]Ivan Bjerre Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Cryptography in the bounded quantum-storage model. ICITS 2005: 24-27 - [i6]Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Cryptography In the Bounded Quantum-Storage Model. CoRR abs/quant-ph/0508222 (2005) - [i5]Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Cryptography In the Bounded Quantum-Storage Model. IACR Cryptol. ePrint Arch. 2005: 291 (2005) - [i4]Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Oblivious Transfer and Linear Functions. IACR Cryptol. ePrint Arch. 2005: 349 (2005) - 2004
- [c8]Ivan Damgård, Serge Fehr, Louis Salvail:
Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks. CRYPTO 2004: 254-272 - [c7]Masayuki Abe, Serge Fehr:
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography. CRYPTO 2004: 317-334 - [c6]Ivan Damgård, Serge Fehr, Kirill Morozov, Louis Salvail:
Unfair Noisy Channels and Oblivious Transfer. TCC 2004: 355-373 - [i3]Masayuki Abe, Serge Fehr:
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography. IACR Cryptol. ePrint Arch. 2004: 119 (2004) - 2003
- [c5]Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz:
Efficient Multi-party Computation over Rings. EUROCRYPT 2003: 596-613 - [i2]Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz:
Efficient Multi-Party Computation over Rings. IACR Cryptol. ePrint Arch. 2003: 30 (2003) - 2002
- [c4]Masayuki Abe, Ronald Cramer, Serge Fehr:
Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments. ASIACRYPT 2002: 206-223 - [c3]Ronald Cramer, Serge Fehr:
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. CRYPTO 2002: 272-287 - [c2]Serge Fehr, Ueli M. Maurer:
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks. CRYPTO 2002: 565-580 - [i1]Ronald Cramer, Serge Fehr:
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. IACR Cryptol. ePrint Arch. 2002: 36 (2002) - 2001
- [c1]Ronald Cramer, Ivan Damgård, Serge Fehr:
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase. CRYPTO 2001: 503-523
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint