Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Dominik Leichtle

dblp:268/8208 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2026
0000-0002-4882-889XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Quantum computing and quantum information · 100%
Network and information security
2 papers
Cryptographic protocols and secure computation · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum games
nonlocal games		 1.012026
Bounding the asymptotic quantum value of all multipartite compiled non-local games · SODA 2026
Cryptographic protocols and secure computation › delegation of computation
delegated quantum computation		 0.412020
Security Limitations of Classical-Client Delegated Quantum Computing · ASIACRYPT (2) 2020
Quantum computing and quantum information
quantum cryptography		 0.112020
Security Limitations of Classical-Client Delegated Quantum Computing · ASIACRYPT (2) 2020

Methods — techniques the papers use, named apart from their topics

cryptographic compilation · 2.0interactive proofs · 1.0interactive proof · 1.0
YearPublicationVenuePosition
2026 Bounding the asymptotic quantum value of all multipartite compiled non-local games
abstract
Non-local games are a powerful tool to distinguish between correlations possible in classical and quantum worlds. Kalai et al. (STOC’23) proposed a compiler that converts multipartite non-local games into interactive protocols with a single prover, relying on cryptographic tools to remove the assumption of physical separation of the players. While quantum completeness and classical soundness of the construction have been established for all multipartite games, quantum soundness is known only in the special case of bipartite games.
Matilde Baroni, Dominik Leichtle, Sinisa Jankovic, Ivan Supic
 SODA2
2020 Security Limitations of Classical-Client Delegated Quantum Computing
Christian Badertscher, Alexandru Cojocaru, Léo Colisson Palais, Elham Kashefi, Dominik Leichtle, Atul Mantri, Petros Wallden
 ASIACRYPT (2)5