default search action
Frédéric Dupuis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Frédéric Dupuis, Robert Y. Lewis, Heather Macbeth
:
Formalized Functional Analysis with Semilinear Maps. J. Autom. Reason. 68(2): 10 (2024) - 2023
- [j10]Frédéric Dupuis
Privacy Amplification and Decoupling Without Smoothing. IEEE Trans. Inf. Theory 69(12): 7784-7792 (2023) - [i17]Ashutosh Marwah, Frédéric Dupuis:
Smooth min-entropy lower bounds for approximation chains. CoRR abs/2308.11736 (2023) - 2022
- [c13]Frédéric Dupuis, Robert Y. Lewis
Formalized functional analysis with semilinear maps. ITP 2022: 10:1-10:19 - [i16]Ashutosh Marwah, Frédéric Dupuis:
Uniform continuity bound for sandwiched Rényi conditional entropy. CoRR abs/2201.05534 (2022) - [i15]Frédéric Dupuis, Robert Y. Lewis, Heather Macbeth:
Formalized functional analysis with semilinear maps. CoRR abs/2202.05360 (2022) - [i14]Frédéric Dupuis, Philippe Lamontagne, Louis Salvail:
Fiat-Shamir for Proofs Lacks a Proof Even in the Presence of Shared Entanglement. CoRR abs/2204.02265 (2022) - [i13]Frédéric Dupuis, Philippe Lamontagne, Louis Salvail:
Fiat-Shamir for Proofs Lacks a Proof Even in the Presence of Shared Entanglement. IACR Cryptol. ePrint Arch. 2022: 435 (2022) - 2021
- [j9]Frédéric Dupuis
Polarization of Quantum Channels Using Clifford-Based Channel Combining. IEEE Trans. Inf. Theory 67(5): 2857-2877 (2021)
2010 – 2019
- 2019
- [j8]Frédéric Dupuis, Omar Fawzi
Entropy Accumulation With Improved Second-Order Term. IEEE Trans. Inf. Theory 65(11): 7596-7612 (2019) - [c12]Frédéric Dupuis, Ashutosh Goswami
Purely Quantum Polar Codes. ITW 2019: 1-5 - 2018
- [c11]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 - [i12]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) - 2016
- [j7]Frédéric Dupuis
Swiveled Rényi entropies. Quantum Inf. Process. 15(3): 1309-1345 (2016) - [c10]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 - [i11]Frédéric Dupuis, Omar Fawzi, Renato Renner:
Entropy accumulation. CoRR abs/1607.01796 (2016) - [i10]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) - 2015
- [j6]Frédéric Dupuis
Entanglement Sampling and Applications. IEEE Trans. Inf. Theory 61(2): 1093-1112 (2015) - [j5]Joseph M. Renes
Efficient Quantum Polar Codes Requiring No Preshared Entanglement. IEEE Trans. Inf. Theory 61(11): 6395-6414 (2015) - [c9]Ivan Damgård, Frédéric Dupuis
On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation. ICITS 2015: 87-104 - [i9]Frédéric Dupuis, Mark M. Wilde:
Swiveled Rényi entropies. CoRR abs/1506.00981 (2015) - 2014
- [j4]Frédéric Dupuis
A Decoupling Approach to Classical Data Transmission Over Quantum Channels. IEEE Trans. Inf. Theory 60(3): 1562-1572 (2014) - [i8]Ivan Damgård, Frédéric Dupuis, Jesper Buus Nielsen:
On The Orthogonal Vector Problem and The Feasibility of Unconditionally Secure Leakage Resilient Computation. IACR Cryptol. ePrint Arch. 2014: 282 (2014) - 2013
- [j3]Alexander Vitanov, Frédéric Dupuis
Chain Rules for Smooth Min- and Max-Entropies. IEEE Trans. Inf. Theory 59(5): 2603-2612 (2013) - [c8]Frédéric Dupuis, Omar Fawzi
Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling. CRYPTO (2) 2013: 326-343 - [c7]David Sutter
Efficient quantum channel coding scheme requiring no preshared entanglement. ISIT 2013: 354-358 - [i7]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) - [i6]Frédéric Dupuis, Omar Fawzi, Stephanie Wehner:
Achieving the limits of the noisy-storage model using entanglement sampling. IACR Cryptol. ePrint Arch. 2013: 360 (2013) - 2012
- [c6]Frédéric Dupuis, Jesper Buus Nielsen
Actively Secure Two-Party Evaluation of Any Quantum Operation. CRYPTO 2012: 794-811 - [c5]David Sutter
Achieving the capacity of any DMC using only polar codes. ITW 2012: 114-118 - [i5]David Sutter, Joseph M. Renes, Frédéric Dupuis, Renato Renner:
Achieving the Capacity of any DMC using only Polar Codes. CoRR abs/1205.3756 (2012) - [i4]Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail:
Actively Secure Two-Party Evaluation of any Quantum Operation. IACR Cryptol. ePrint Arch. 2012: 304 (2012) - 2011
- [c4]Frédéric Dupuis, Jan Florjanczyk, Patrick M. Hayden
The Locking-Decoding Frontier for Generic Dynamics. TQC 2011: 23-38 - [i3]Gilles Brassard, Frédéric Dupuis, Sébastien Gambs, Alain Tapp:
An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance. CoRR abs/1106.4267 (2011) - [i2]Joseph M. Renes, Frédéric Dupuis, Renato Renner:
Efficient Quantum Polar Coding. CoRR abs/1109.3195 (2011) - 2010
- [j2]Frédéric Dupuis
A father protocol for quantum broadcast channels. IEEE Trans. Inf. Theory 56(6): 2946-2956 (2010) - [j1]Simon Pierre Desrosiers, Frédéric Dupuis
Quantum entropic security and approximate quantum encryption. IEEE Trans. Inf. Theory 56(7): 3455-3464 (2010) - [c3]Frédéric Dupuis, Jesper Buus Nielsen
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries. CRYPTO 2010: 685-706
2000 – 2009
- 2009
- [c2]Frédéric Dupuis
The capacity of quantum channels with side information at the transmitter. ISIT 2009: 948-952 - 2006
- [i1]Frédéric Dupuis, Patrick M. Hayden, Ke Li:
A father protocol for quantum broadcast channels. CoRR abs/quant-ph/0612155 (2006) - 2004
- [c1]Frédéric Dupuis, Wei Yu, Frans M. J. Willems:
Blahut-Arimoto algorithms for computing channel capacity and rate-distortion with side information. ISIT 2004: 179
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-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: