default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Kaplan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i11]Mina Doosti, Lucas Hanouz, Anne Marin, Elham Kashefi, Marc Kaplan:
Establishing shared secret keys on quantum line networks: protocol and security. CoRR abs/2304.01881 (2023)- 2021
- [i10]Yao Ma, Elham Kashefi, Myrto Arapinis, Kaushik Chakraborty, Marc Kaplan
:
QEnclave - A practical solution for secure quantum cloud computing. CoRR abs/2109.02952 (2021) - 2020
- [i9]Ehsan Ebrahimi, Céline Chevalier, Marc Kaplan, Michele Minelli:
Superposition Attack on OT Protocols. IACR Cryptol. ePrint Arch. 2020: 798 (2020)
2010 – 2019
- 2019
- [j5]Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail:
Key Establishment à la Merkle in a Quantum World. J. Cryptol. 32(3): 601-634 (2019) - [i8]Céline Chevalier, Marc Kaplan, Quoc-Huy Vu:
On the Everlasting Security of Password-Authenticated Quantum Key Exchange. CoRR abs/1904.01526 (2019) - 2017
- [c7]Aleksandrs Belovs, Gilles Brassard, Peter Høyer, Marc Kaplan, Sophie Laplante, Louis Salvail:
Provably Secure Key Establishment Against Quantum Adversaries. TQC 2017: 3:1-3:17 - [i7]Jean-Charles Faugère, Kelsey Horan, Delaram Kahrobaei, Marc Kaplan, Elham Kashefi, Ludovic Perret:
Fast Quantum Algorithm for Solving Multivariate Quadratic Equations. CoRR abs/1712.07211 (2017) - [i6]Jean-Charles Faugère, Kelsey Horan, Delaram Kahrobaei, Marc Kaplan, Elham Kashefi, Ludovic Perret:
Fast Quantum Algorithm for Solving Multivariate Quadratic Equations. IACR Cryptol. ePrint Arch. 2017: 1236 (2017) - 2016
- [j4]Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia:
Quantum Differential and Linear Cryptanalysis. IACR Trans. Symmetric Cryptol. 2016(1): 71-94 (2016) - [c6]Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia:
Breaking Symmetric Cryptosystems Using Quantum Period Finding. CRYPTO (2) 2016: 207-237 - [i5]Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia:
Breaking Symmetric Cryptosystems using Quantum Period Finding. CoRR abs/1602.05973 (2016) - 2015
- [i4]Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia:
Quantum Differential and Linear Cryptanalysis. CoRR abs/1510.05836 (2015) - 2014
- [i3]Marc Kaplan:
Quantum attacks against iterated block ciphers. CoRR abs/1410.1434 (2014) - 2012
- [c5]Gilles Brassard, Marc Kaplan:
Simulating Equatorial Measurements on GHZ States with Finite Expected Communication Cost. TQC 2012: 65-73 - 2011
- [j3]Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland:
Non-local box complexity and secure function evaluation. Quantum Inf. Comput. 11(1&2): 40-69 (2011) - [j2]Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland:
The communication complexity of non-signaling distributions. Quantum Inf. Comput. 11(7&8): 649-676 (2011) - [j1]Marc Kaplan, Sophie Laplante:
Kolmogorov complexity and combinatorial methods in communication complexity. Theor. Comput. Sci. 412(23): 2524-2535 (2011) - [c4]Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail:
Merkle Puzzles in a Quantum World. CRYPTO 2011: 391-410
2000 – 2009
- 2009
- [b1]Marc Kaplan:
Méthodes Combinatoires et Algébriques en Complexité de la Communication. University of Paris-Sud, Orsay, France, 2009 - [c3]Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland:
Non-Local Box Complexity and Secure Function Evaluation. FSTTCS 2009: 239-250 - [c2]Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland:
The Communication Complexity of Non-signaling Distributions. MFCS 2009: 270-281 - [c1]Marc Kaplan, Sophie Laplante:
Kolmogorov Complexity and Combinatorial Methods in Communication Complexity. TAMC 2009: 261-270 - 2008
- [i2]Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland:
The communication complexity of non-signaling distributions. CoRR abs/0804.4859 (2008) - [i1]Marc Kaplan, Sophie Laplante:
Kolmogorov complexity and combinatorial methods in communication complexity. Electron. Colloquium Comput. Complex. TR08 (2008)
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:25 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:
