Conditional anonymity with non-probabilistic adversary

DOI10.1016/j.ins.2015.06.018zbMath1441.94072OpenAlexW785170650MaRDI QIDQ1750044

Yongzhi Cao, Weien Chen, Hanpin Wang

Publication date: 17 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.06.018

zbMATH Keywords

anonymitystrong anonymityconditional anonymityanonymity metricnon-probabilistic adversary

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information hiding in probabilistic concurrent systems
• Probable innocence revisited
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Anonymity protocols as noisy channels
• Privacy-preserving trajectory data publishing by local suppression
• Weak Probabilistic Anonymity
• Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
• On the Foundations of Quantitative Information Flow
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• CSP and anonymity
• A quantitative doxastic logic for probabilistic processes and applications to information-hiding
• Compositional Methods for Information-Hiding
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Conditional anonymity with non-probabilistic adversary