Breaking Anonymity by Learning a Unique Minimum Hitting Set

DOI10.1007/978-3-642-03351-3_28MaRDI QIDQ3392966zbMATH OpenOpenAlexFDO

Authors Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith

Publication date 18 August 2009

Published in Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03351-3_28

Mathematics Subject Classification ID

Computational learning theory (68Q32) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1952747
• Financial Cryptography
• Analyzing anonymity attacks through noisy channels
• Anonymity Protocols as Noisy Channels
• scientific article; zbMATH DE number 2090930

Cites work

• scientific article; zbMATH DE number 5605070 (Why is no real title available?)
• scientific article; zbMATH DE number 2083808 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Stochastic finite learning of the pattern languages
• The dining cryptographers problem: Unconditional sender and recipient untraceability

This page was built for publication: Breaking Anonymity by Learning a Unique Minimum Hitting Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392966)