D. Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology 1(1), pp.65-75, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Discount Anonymous On Demand Routing for - Mobile Ad Hoc (Correct)
No context found.
D. Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology 1(1), pp.65-75, 1988.
Security Protocols with Isotropic Channels - Madhukar Anand Eric (Correct)
No context found.
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65--75, 1988.
Probable Innocence Revisited - Konstantinos Chatzikokolakis Catuscia (Correct)
No context found.
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65--75, 1988.
A Survey of Anonymous Peer-to-Peer - File-Sharing Tom Chothia (Correct)
No context found.
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untranceability. Communications of the ACM, 24(2), 1988.
Toward the Preservation of a Key Feature of the Internet: Policy .. - Mandujano (2003) (Correct)
No context found.
D. Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology 1/1 (1988). 65-75.
A Practical Buses Protocol for Anonymous Internet.. - Hirt, Jacobson, Jr.. (2005) (Correct)
No context found.
D. Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology, 1(1):65--75, 1988.
Private Collaborative Forecasting and Benchmarking - Atallah, Bykova, Li.. (2004) (1 citation) (Correct)
No context found.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65--75, 1988.
The Topology of Covert Conflict - Shishir Nagaraja Ross (2006) (1 citation) (Correct)
No context found.
D Chaum, "The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability ", in Journal of Cryptology v 1 (1989) pp 65--75
Receiver Anonymity via Incomparable Public Keys - Waters, Felten, Sahai (2003) (2 citations) (Correct)
No context found.
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1(1), pages 65--75, 1988.
Spreading Alerts Quietly - And The Subgroup (2005) (Correct)
No context found.
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65--75, 1988.
Improving the Decoding Efficiency of Private Search - Danezis, Diaz (2006) (Correct)
No context found.
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology, 1(1):65--75, 1988.
Privacy Management for Portable Recording Devices - Alex Halderman Brent (Correct)
No context found.
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptol., 1(1):65--75, 1988.
Formal Notions of Anonymity for Peer-to-peer Networks - Kong (2005) (Correct)
No context found.
D. L. Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology, 1(1):65--75, 1988.
Weak Probabilistic Anonymity - Deng, Palamidessi, Pang (2005) (Correct)
No context found.
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65-75, 1988.
Private Keyword-Based Push and Pull with.. - Kissner, Oprea.. (2004) (Correct)
No context found.
D. Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. In Journal of Cryptology, 1(1), pp 65-75, 1988.
Verification of Multiagent Systems via Ordered Binary.. - Raimondi, Lomuscio (2004) (Correct)
No context found.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65--75, 1988.
A Tool For Specification And Verification Of Epistemic.. - Raimondi, Lomuscio (2004) (3 citations) (Correct)
No context found.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65--75, 1988.
Location Privacy In Ubiquitous Computing - Beresford (2005) (2 citations) (Correct)
No context found.
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):66--75, 1988. (Ref: p. 46.)
Correct and Private Reductions among Oblivious Transfers - Crepeau (1990) (Correct)
No context found.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65--75, 1988.
Verification of Multiagent Systems via Ordered Binary.. - Raimondi, Lomuscio (2004) (Correct)
No context found.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65--75, 1988.
Verification In Multi-Agent Systems - Raimondi (Correct)
No context found.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65-75, 1988.
Verification of Multiagent Systems via Ordered Binary.. - Raimondi, Lomuscio (2004) (Correct)
No context found.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65--75, 1988.
A Tool for Specification and Verification of Epistemic.. - Raimondi, Lomuscio (2003) (3 citations) (Correct)
No context found.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65--75, 1988.
True Anonymity without Mixes - Molina-Jimenez, Marshall (2001) (Correct)
No context found.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1), 1988.
Model Checking Epistemic Properties of Interpreted Systems - Raimondi (2003) (Correct)
No context found.
D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65-75, 1988. 8
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC