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

Longxin Wang

dblp:340/3710 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2024
—ORCID · conflict

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

Security and privacy · 2 · 2 since 2021Computer networks · 1 · 1 first-author · 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.

Network and information security
2 papers
Cryptographic protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
private set intersection
1.522024
Efficient Scalable Multi-Party Private Set Intersection(-Variants) from Bicentric Zero-Sharing · CCS 2024
Efficient Fuzzy Private Set Intersection from Fuzzy Mapping · ASIACRYPT (6) 2024
Cryptographic protocols and secure computation › private set intersection
fuzzy private set intersection
0.812024
Efficient Fuzzy Private Set Intersection from Fuzzy Mapping · ASIACRYPT (6) 2024
Cryptographic protocols and secure computation › private set intersection
multi-party private set intersection
0.812024
Efficient Scalable Multi-Party Private Set Intersection(-Variants) from Bicentric Zero-Sharing · CCS 2024
Cryptographic protocols and secure computation › private set intersection
private set intersection cardinality
0.812024
Efficient Scalable Multi-Party Private Set Intersection(-Variants) from Bicentric Zero-Sharing · CCS 2024
Cryptographic protocols and secure computation › private set intersection
threshold private set intersection
0.812024
Efficient Scalable Multi-Party Private Set Intersection(-Variants) from Bicentric Zero-Sharing · CCS 2024

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

symmetric-key cryptography · 0.8oblivious key-value store · 0.8fuzzy mapping · 0.8bicentric zero-sharing · 0.8
YearPublicationVenuePosition
2024 Efficient Fuzzy Private Set Intersection from Fuzzy Mapping
Ying Gao 0006, Yuanchao Luo, Longxin Wang
ASIACRYPT (6)5
2024 Efficient Scalable Multi-Party Private Set Intersection(-Variants) from Bicentric Zero-Sharing
abstract
Multi-party private set intersection (MPSI) allows 𝑛(𝑛 ≥ 3) participants, each holding a dataset of size 𝑚, to compute the intersection of their sets without revealing any additional information.We extract a primitive called bicentric zero-sharing, which can reduce MPSI to two-party PSI between two central participants named Pivot and Leader.We introduce an efficient instantiation of bicentric zero-sharing, which involves a round of sharing and reconstruction of an oblivious key-value store (OKVS) object.We then combine this construction with two-party PSI to propose a new efficient scalable MPSI protocol.We also propose protocols for computing MPSI variants based on bicentric zero-sharing, such as multi-party private set intersection cardinality (MPSI-CA) and multi-party threshold private set intersection (MTPSI).Our protocols are mainly based on symmetric-key operations, and the communication complexity of each participant is at most O (𝑛 + 𝑚).The security of our protocols relies on the assumption * The first two authors contribute equally.
Ying Gao 0006, Yuanchao Luo, Longxin Wang, Wei Wang 0420, Mengmeng Zhou
CCS3
2023 Optimal Charging Profile Design for Solar-Powered Sustainable UAV Communication Networks
abstract
This work studies optimal solar charging for solar-powered self-sustainable UAV communication networks, considering the day-scale time-variability of solar radiation and user service demand. The objective is to optimally trade off between the user coverage performance and the net energy loss of the network by proactively assigning UAVs to serve, charge, or land. Specifically, the studied problem is first formulated into a time-coupled mixed-integer non-convex optimization problem, and further decoupled into two sub-problems for tractability. To solve the challenge caused by time-coupling, deep reinforcement learning (DRL) algorithms are respectively designed for the two sub-problems. Particularly, a relaxation mechanism is put forward to overcome the “dimension curse” incurred by the large discrete action space in the second sub-problem. At last, simulation results demonstrate the efficacy of our designed DRL algorithms in trading off the communication performance against the net energy loss, and the impact of different parameters on the tradeoff performance.
Longxin Wang, Saugat Tripathi, Ran Zhang 0001, Nan Cheng 0001, Miao Wang 0003
ICC1