Perfect anonymity

DOI10.1109/TIT.2019.2893334MaRDI QIDQ5224048zbMATH OpenOpenAlexFDO

Authors Yvo Desmedt, Fred C. Piper

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2019.2893334

zbMATH Keywords

contrast with Chaum's approachdefinition of perfect anonymityimpact on Chaum's dining cryptographer's solution

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Anonymous symmetric-key communication
• Financial Cryptography
• CONCUR 2005 – Concurrency Theory
• Cryptographic defense against traffic analysis

Cited in

(6)

• The dining cryptographers problem: Unconditional sender and recipient untraceability
• scientific article; zbMATH DE number 2185759 (Why is no real title available?)
• scientific article; zbMATH DE number 2102684 (Why is no real title available?)
• Practical Everlasting Privacy
• Anonymous whistleblowing over authenticated channels
• Lower bounds on anonymous whistleblowing

This page was built for publication: Perfect anonymity

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