Unconditional sender and recipient untraceability in spite of active attacks

DOI10.1007/3-540-46885-4_32MaRDI QIDQ3973157zbMATH OpenFDO

Authors Michael Waidner

Publication date 26 June 1992

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

Full work available at URL https://doi.org/10.1007/3-540-46885-4_32

zbMATH Keywords

communication networkDC-netprotocolreliable broadcast networksecure Byzantine Agreement

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Communication theory (94A05) Cryptography (94A60) Circuits, networks (94C99)

Recommendations

• Fast and unconditionally secure anonymous channel
• Cryptographic defense against traffic analysis
• Financial Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)

Cited in

(9)

• The dining cryptographers problem: Unconditional sender and recipient untraceability
• An efficient protocol for anonymous multicast and reception.
• Fast and unconditionally secure anonymous channel
• Beating the birthday paradox in dining cryptographer networks
• Dining cryptographers with 0.924 verifiable collision resolution
• CSP and anonymity
• Advances in Cryptology - EUROCRYPT 2004
• Footprint scheduling for dining-cryptographer networks
• \(k\)-anonymous data collection

This page was built for publication: Unconditional sender and recipient untraceability in spite of active attacks

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