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

Tian-Yu Ye

dblp:174/7508 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-5581-9895ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Cryptographic protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
secure multiparty computation
0.912025
A Novel Two-Round Two-Party Quantum Private Comparison Protocol Based on Quantum Walks · IEEE Trans. Computers 2025
Quantum computing and quantum information
quantum cryptography
0.912025
A Novel Two-Round Two-Party Quantum Private Comparison Protocol Based on Quantum Walks · IEEE Trans. Computers 2025
Quantum computing and quantum information › quantum algorithms
quantum walk
0.912025
A Novel Two-Round Two-Party Quantum Private Comparison Protocol Based on Quantum Walks · IEEE Trans. Computers 2025

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

unitary operations · 1.7d-dimensional single particle measurements · 1.7IBM Qiskit simulator · 1.7
YearPublicationVenuePosition
2025 A Novel Two-Round Two-Party Quantum Private Comparison Protocol Based on Quantum Walks
abstract
In order to compare the size relationship and the equality of private integers from two users without any risk of leaking their secrets, we put forward a novel two-round two-party quantum private comparison (QPC) protocol with a third party (TP) based on one-direction quantum walks on a circle (ODQWC). Here, TP is allowed to launch all kinds of possible attacks except the collusion attack. This protocol adopts quantum walk (QW) states as the initial quantum resource, which are actually a kind of two-particle product states. This protocol doesn’t need any pre-shared secret key or quantum entanglement swapping operation, and only adopts unitary operations andd-dimensional single particle measurements. Security analysis validates the security of the proposed protocol against both the outside attacks and the participant attacks. Compared with previous QPC protocols based on QW, this protocol is more efficient under certain conditions. Moreover, we construct quantum circuits for this protocol and reveal its correctness and feasibility by IBM Qiskit simulator.
Tian-Yu Ye
IEEE Trans. Computers2
2016 3D B-spline curve construction from orthogonal views with self-overlapping projection segments
Yang Lu 0005, Jun-Hai Yong, Kanle Shi, Tian-Yu Ye
Comput. Graph.5