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

Haixia Xue

dblp:09/10367 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 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.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.112012
Round-optimal zero-knowledge proofs of knowledge for NP · Sci. China Inf. Sci. 2012
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › proofs of knowledge
zero-knowledge proof of knowledge
0.112012
Round-optimal zero-knowledge proofs of knowledge for NP · Sci. China Inf. Sci. 2012
Computational complexity › complexity classes
NP
0.012012
Round-optimal zero-knowledge proofs of knowledge for NP · Sci. China Inf. Sci. 2012

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

round-optimal protocols · 0.3
YearPublicationVenuePosition
2012 Round-optimal zero-knowledge proofs of knowledge for NP
Hongda Li 0001, Dengguo Feng, Bao Li 0001, Haixia Xue
Sci. China Inf. Sci.4