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

Stefano Carretta

dblp:203/8362 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-2536-1326ORCID · reported

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

Computer networks · 1

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
1 paper
Quantum computing and quantum information · 100%
Network and information security
1 paper
Network security · 100%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum entanglement
entanglement verification		 0.412020
Entanglement Verification in Quantum Networks With Tampered Nodes · IEEE J. Sel. Areas Commun. 2020
Quantum computing and quantum information
quantum network		 0.412020
Entanglement Verification in Quantum Networks With Tampered Nodes · IEEE J. Sel. Areas Commun. 2020
Network security › intrusion detection and prevention
intrusion detection		 0.112020
Entanglement Verification in Quantum Networks With Tampered Nodes · IEEE J. Sel. Areas Commun. 2020
Network security › secure communication
quantum network security		 0.112020
Entanglement Verification in Quantum Networks With Tampered Nodes · IEEE J. Sel. Areas Commun. 2020

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

local operations and classical communication · 0.9verification protocols · 0.4verification protocol · 0.4
YearPublicationVenuePosition
2020 Entanglement Verification in Quantum Networks With Tampered Nodes
abstract
In this paper, we consider the problem of entanglement verification across the quantum memories of any two nodes of a quantum network. Its solution can be a means for detecting (albeit not preventing) the presence of intruders that have taken full control of a node, either to make a denial-of-service attack or to reprogram the node. Looking for strategies that only require local operations and classical communication (LOCC), we propose two entanglement verification protocols characterized by increasing robustness and efficiency.
Michele Amoretti, Stefano Carretta
 IEEE J. Sel. Areas Commun.2