Breaking Anonymity by Learning a Unique Minimum Hitting Set

DOI10.1007/978-3-642-03351-3_28zbMath1248.94076OpenAlexW1583040866MaRDI QIDQ3392966

Stefan Richter, Daniel Mölle, Dogan Kesdogan, 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Stochastic finite learning of the pattern languages

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