The dining cryptographers problem: Unconditional sender and recipient untraceability

DOI10.1007/BF00206326zbMath0654.94012WikidataQ56172630 ScholiaQ56172630MaRDI QIDQ1109008

David Chaum

Publication date: 1988

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

unconditional securityuntraceabilitydining cryptographers problemone-time-use keyspseudonymitypublic keys

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (only showing first 100 items - show all)

Quantifying leakage in the presence of unreliable sources of information ⋮ A practical anonymous payment scheme for electronic commerce ⋮ Secret sets and applications ⋮ Unconditionally secure quantum signatures ⋮ Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams ⋮ Topology-hiding computation beyond semi-honest adversaries ⋮ Best possible information-theoretic MPC ⋮ Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security ⋮ A space-efficient simulation algorithm on probabilistic automata ⋮ Anonymous Communication and Anonymous Cash ⋮ Probabilistic and nondeterministic aspects of anonymity ⋮ A computationally grounded, weighted doxastic logic ⋮ Unnamed Item ⋮ Practical verification of multi-agent systems against \textsc{Slk} specifications ⋮ Symbolic Model Checking for Dynamic Epistemic Logic ⋮ Secure Multi-party Shuffling ⋮ Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers ⋮ An efficient multi-receipt mechanism for uncoercible anonymous electronic voting ⋮ The cost of becoming anonymous: on the participant payload in crowds ⋮ Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol ⋮ Blind one-time signature and its applications ⋮ Probable innocence revisited ⋮ Abstraction for model checking multi-agent systems ⋮ Modular verification of protocol equivalence in the presence of randomness ⋮ A better composition operator for quantitative information flow analyses ⋮ Summing over a network without revealing summands ⋮ Comparative analysis of related notions of opacity in centralized and coordinated architectures ⋮ Parametric probabilistic transition systems for system design and analysis ⋮ Weak bisimulation for probabilistic timed automata ⋮ A cooperative quantum anonymous transmission with hybrid entanglement swapping ⋮ A blind coupon mechanism enabling veto voting over unreliable networks ⋮ Beating the Birthday Paradox in Dining Cryptographer Networks ⋮ Hybrid statistical estimation of mutual information and its application to information flow ⋮ CSP and anonymity ⋮ Unconditional Byzantine agreement for any number of faulty processors ⋮ Information-Theoretic Security Without an Honest Majority ⋮ Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap ⋮ To know or not to know: Epistemic approaches to security protocol verification ⋮ Security invariants in discrete transition systems ⋮ Dining Cryptographers with 0.924 Verifiable Collision Resolution ⋮ A faster cryptographer's Conspiracy Santa ⋮ Spreading alerts quietly and the subgroup escape problem ⋮ The Secret Santa Problem ⋮ Unnamed Item ⋮ Information theoretical cryptogenography ⋮ Verification and control of partially observable probabilistic systems ⋮ Quantum private communication with an anonymous sender ⋮ Compositional noninterference from first principles ⋮ Quantum anonymous voting with anonymity check ⋮ A universally composable framework for the privacy of email ecosystems ⋮ Unnamed Item ⋮ Towards quantum-based privacy and voting ⋮ The meeting businessmen problem: requirements and limitations ⋮ Probabilistic opacity for Markov decision processes ⋮ The shadow knows: refinement and security in sequential programs ⋮ Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms ⋮ Exact quantitative probabilistic model checking through rational search ⋮ How to Brew-up a Refinement Ordering ⋮ Beyond Knowing That: A New Generation of Epistemic Logics ⋮ Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic ⋮ Symbolic Model Checking the Knowledge in Herbivore Protocol ⋮ Verification of initial-state opacity in security applications of discrete event systems ⋮ Analyzing anonymity attacks through noisy channels ⋮ ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH ⋮ Opacity for linear constraint Markov chains ⋮ Conditional anonymity with non-probabilistic adversary ⋮ An anonymous surveying protocol via Greenberger-Horne-Zeilinger states ⋮ Algorithmic probabilistic game semantics. Playing games with automata ⋮ Anonymity protocols as noisy channels ⋮ Formal Semantics of a Dynamic Epistemic Logic for Describing Knowledge Properties of π-Calculus Processes ⋮ Information hiding in probabilistic concurrent systems ⋮ Probabilistic anonymity via coalgebraic simulations ⋮ New bounds for randomized busing ⋮ Unnamed Item ⋮ Making random choices invisible to the scheduler ⋮ Abstractions of non-interference security: probabilistic versus possibilistic ⋮ Automatic verification of temporal-epistemic properties of cryptographic protocols ⋮ An algebraic approach for reasoning about information flow ⋮ A one-round secure message broadcasting protocol through a key sharing tree ⋮ Anonymity Protocols as Noisy Channels ⋮ A Framework for Automatically Checking Anonymity with μCRL ⋮ \(k\)-anonymous data collection ⋮ Bisimulation for Demonic Schedulers ⋮ Provable unlinkability against traffic analysis with low message overhead ⋮ Worst- and average-case privacy breaches in randomization mechanisms ⋮ Positive announcements ⋮ The Power of Anonymous Veto in Public Discussion ⋮ Formalization of Entropy Measures in HOL ⋮ Non-interactive anonymous router ⋮ Quantitative Information Flow and Applications to Differential Privacy ⋮ Breaking Anonymity by Learning a Unique Minimum Hitting Set ⋮ Knowledge and Action in Semi-public Environments ⋮ Network-Hiding Communication and Applications to Multi-party Protocols ⋮ Spreading the privacy blanket: differentially oblivious shuffling for differential privacy ⋮ An efficient protocol for anonymous multicast and reception. ⋮ A new post-quantum voting protocol based on physical laws ⋮ Weak Probabilistic Anonymity ⋮ Practical anonymous entanglement with noisy measurement ⋮ Security analysis and improvement of the dining cryptographer problem-based anonymous quantum communication via non-maximally entanglement state analysis ⋮ The design of a secure and fair sealed-bid auction service

Cites Work

• Secure communications over insecure channels
• New directions in cryptography

This page was built for publication: The dining cryptographers problem: Unconditional sender and recipient untraceability