Financial Cryptography

DOI10.1007/B98935MaRDI QIDQ4680927zbMATH OpenOpenAlexFDO

Authors Ron Berman, Amnon Ta-Shma, Amos Fiat

Publication date 13 June 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98935

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Information theory (general) (94A15) Cryptography (94A60)

Recommendations

• Provable unlinkability against traffic analysis with low message overhead
• Information Security
• Cryptographic defense against traffic analysis
• Anonymity Protocols as Noisy Channels
• A Model of Onion Routing with Provable Anonymity

Cited in

(12)

• Buses for anonymous message delivery
• Anonymity protocols as noisy channels
• Provable unlinkability against traffic analysis with low message overhead
• scientific article; zbMATH DE number 1690173 (Why is no real title available?)
• Breaking Anonymity by Learning a Unique Minimum Hitting Set
• Secure Multi-party Shuffling
• scientific article; zbMATH DE number 16478 (Why is no real title available?)
• Practical and provably secure onion routing
• Perfect anonymity
• Cryptographic defense against traffic analysis
• Information Security
• Bruisable onions: anonymous communication in the asynchronous model

This page was built for publication: Financial Cryptography

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