Poly onions: achieving anonymity in the presence of churn

DOI10.1007/978-3-031-22365-5_25zbMath1519.94032OpenAlexW4312328859MaRDI QIDQ6169429

Megumi Ando, Tal Malkin, Miranda Christ, Anna Lysyanskaya

Publication date: 14 August 2023

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22365-5_25

zbMATH Keywords

anonymous communicationdynamic network with churn

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25) Privacy of data (68P27)

Cites Work

• Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
• Cryptographic shallots: a formal treatment of repliable onion encryption
• Cryptographic defense against traffic analysis
• A Formal Treatment of Onion Routing
• Probability and Computing
• Onion routing with replies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Poly onions: achieving anonymity in the presence of churn