The dining cryptographers problem: Unconditional sender and recipient untraceability
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Summing over a network without revealing summands
- Topology-hiding computation beyond semi-honest adversaries
- Best possible information-theoretic MPC
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- Practical verification of multi-agent systems against \textsc{Slk} specifications
- Information theoretical cryptogenography
- Verification and control of partially observable probabilistic systems
- A universally composable framework for the privacy of email ecosystems
- Opacity for linear constraint Markov chains
- Conditional anonymity with non-probabilistic adversary
- New bounds for randomized busing
- An efficient protocol for anonymous multicast and reception.
- A practical anonymous payment scheme for electronic commerce
- Security invariants in discrete transition systems
- Quantum private communication with an anonymous sender
- Towards quantum-based privacy and voting
- Abstractions of non-interference security: probabilistic versus possibilistic
- An algebraic approach for reasoning about information flow
- Positive announcements
- Non-interactive anonymous router
- Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
- A new post-quantum voting protocol based on physical laws
- Practical anonymous entanglement with noisy measurement
- Modular verification of protocol equivalence in the presence of randomness
- A better composition operator for quantitative information flow analyses
- A blind coupon mechanism enabling veto voting over unreliable networks
- A faster cryptographer's Conspiracy Santa
- Exact quantitative probabilistic model checking through rational search
- Algorithmic probabilistic game semantics. Playing games with automata
- Security analysis and improvement of the dining cryptographer problem-based anonymous quantum communication via non-maximally entanglement state analysis
- Quantifying leakage in the presence of unreliable sources of information
- Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
- 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
- Hybrid statistical estimation of mutual information and its application to information flow
- The meeting businessmen problem: requirements and limitations
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
- Anonymity protocols as noisy channels
- Provable unlinkability against traffic analysis with low message overhead
- Worst- and average-case privacy breaches in randomization mechanisms
- A space-efficient simulation algorithm on probabilistic automata
- Network-Hiding Communication and Applications to Multi-party Protocols
- Weak probabilistic anonymity
- Secret sets and applications
- Beating the birthday paradox in dining cryptographer networks
- Dining cryptographers with 0.924 verifiable collision resolution
- Unconditionally secure quantum signatures
- How to brew-up a refinement ordering
- Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
- Symbolic model checking the knowledge in Herbivore protocol
- Formalization of entropy measures in HOL
- Quantitative information flow and applications to differential privacy
- Knowledge and action in semi-public environments
- A computationally grounded, weighted doxastic logic
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
- Beyond knowing that: a new generation of epistemic logics
- A cryptographer's Conspiracy Santa
- Optimizing epistemic model checking using conditional independence (extended abstract)
- Breaking Anonymity by Learning a Unique Minimum Hitting Set
- Anonymous communication and anonymous cash
- Symbolic Model Checking for Dynamic Epistemic Logic
- Secure Multi-party Shuffling
- Information-Theoretic Security Without an Honest Majority
- Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
- The Secret Santa Problem
- Abstraction for model checking multi-agent systems
- Formal semantics of a dynamic epistemic logic for describing knowledge properties of \(\pi \)-calculus processes
- Anonymity Protocols as Noisy Channels
- A Framework for Automatically Checking Anonymity with μCRL
- Bisimulation for Demonic Schedulers
- The Power of Anonymous Veto in Public Discussion
- Comparative analysis of related notions of opacity in centralized and coordinated architectures
- A cooperative quantum anonymous transmission with hybrid entanglement swapping
- Compositional noninterference from first principles
- Quantum anonymous voting with anonymity check
- Equational reasonings in wireless network gossip protocols
- Probabilistic opacity for Markov decision processes
- Anonymity without `Cryptography' (Extended abstract)
- Blind one-time signature and its applications
- Absolutely secure message transmission using a key sharing graph
- Verification of initial-state opacity in security applications of discrete event systems
- Analyzing anonymity attacks through noisy channels
- Practical and provably secure onion routing
- CSP and anonymity
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- An anonymous surveying protocol via Greenberger-Horne-Zeilinger states
- Automatic verification of temporal-epistemic properties of cryptographic protocols
- A quantitative doxastic logic for probabilistic processes and applications to information-hiding
- Perfect anonymity
- Location privacy in WSNs: solutions, challenges, and future trends
- Another twist in the dining cryptographers' protocol
- Conditional Probabilities over Probabilistic and Nondeterministic Systems
- Compositional Methods for Information-Hiding
- Information hiding in probabilistic concurrent systems
- Anonymous Quantum Communication
- Regular model checking revisited
- Correction to: ``Topology-hiding communication from minimal assumptions
- Weak bisimulation for probabilistic timed automata
- A theory of composition for differential obliviousness
This page was built for publication: The dining cryptographers problem: Unconditional sender and recipient untraceability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109008)