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

Yuanzhong Fu

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

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

Computer networks · 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.

Network and information security
1 paper
Network security · 50% Cryptographic protocols and secure computation · 50%

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

TopicWeightPapersLastEvidence papers
Network security
anonymity networks
0.812024
Periscoping: Private Key Distribution for Large-Scale Mixnets · INFOCOM 2024
Network security › anonymity networks
mix networks
0.812024
Periscoping: Private Key Distribution for Large-Scale Mixnets · INFOCOM 2024
Cryptographic protocols and secure computation
private information retrieval
0.812024
Periscoping: Private Key Distribution for Large-Scale Mixnets · INFOCOM 2024
Cryptographic protocols and secure computation › key management › key distribution
secret key distribution
0.812024
Periscoping: Private Key Distribution for Large-Scale Mixnets · INFOCOM 2024

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

constrained pseudorandom functions · 0.8
YearPublicationVenuePosition
2024 Periscoping: Private Key Distribution for Large-Scale Mixnets
abstract
Mix networks, or mixnets, are one of the fundamental building blocks of anonymity systems. To defend against epistemic attacks, existing free-route mixnet designs require all clients to maintain a consistent, up-to-date view of the entire key directory. This, however, inevitably raises the performance concern under system scale-out: in a larger mixnet, a client will consume more bandwidth for updating keys in the background.This paper presents Periscoping, a key distribution protocol for mixnets at scale. Periscoping relaxes the download-all requirement for clients. Instead, it allows a client to selectively download a constant number of entries of the key directory, while guaranteeing the privacy of selections. Periscoping achieves this goal via a novel Private Information Retrieval scheme, constructed based on constrained Pseudorandom Functions. Moreover, the protocol is integrated seamlessly into the mixnet operations, readily applicable to existing mixnet systems as an extension at a minimal cost. Our experiments show that, with millions of mixes, it can reduce the traffic load of a mixnet by orders of magnitude, at a minor computational and bandwidth overhead.
Shuhao Liu 0001, Li Chen 0019, Yuanzhong Fu
INFOCOM3