Unconditional Sender and Recipient Untraceability in Spite of Active Attacks-Reference-Cited by-同舟云学术

Unconditional Sender and Recipient Untraceability in Spite of Active Attacks

Published: Issue: Volume: Page:302-319
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Waidner Michael

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46885-4_32.pdf

Reference28 articles.

1. M. Ben-Or, S. Goldwasser, A. Wigderson: Completeness theorems for non-cryptographic fault-tolerant distributed computation; 20th STOC, ACM, New York 1988, 1–10.

2. J. Bos, B. den Boer: Detection of Disrupters in the DC Protocol; Abstracts of Eurocrypt’ 89.

3. D. Chaum: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms; CACM 24/2 (1981) 84–88.

4. D. Chaum: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability; J. of Cryptology 1/1 (1988) 65–75 (draft received May 13, 1985).

5. D. Chaum: The Spymasters Double-Agent Problem — Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities; rec. July 21, 1989, announced for Crypto’ 89.

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Non-interactive Anonymous Communication;IFIP Advances in Information and Communication Technology;2024

2. Dining Cryptographers (DC) Network;Encyclopedia of Cryptography, Security and Privacy;2023

3. Fast and Flexible Elliptic Curve Cryptography for Dining Cryptographers Networks;Mobile, Secure, and Programmable Networking;2021

4. Asynchronous Provably-Secure Hidden Services;Lecture Notes in Computer Science;2018

5. Strain: A Secure Auction for Blockchains;Computer Security;2018