Pages that link to "Item:Q1109008"
From MaRDI portal
The following pages link to The dining cryptographers problem: Unconditional sender and recipient untraceability (Q1109008):
Displaying 50 items.
- A blind coupon mechanism enabling veto voting over unreliable networks (Q2179393) (← links)
- A faster cryptographer's Conspiracy Santa (Q2196567) (← links)
- Exact quantitative probabilistic model checking through rational search (Q2225475) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- Security analysis and improvement of the dining cryptographer problem-based anonymous quantum communication via non-maximally entanglement state analysis (Q2348636) (← links)
- Quantifying leakage in the presence of unreliable sources of information (Q2361344) (← links)
- Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams (Q2372185) (← links)
- An efficient multi-receipt mechanism for uncoercible anonymous electronic voting (Q2389795) (← links)
- The cost of becoming anonymous: on the participant payload in crowds (Q2390227) (← links)
- Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol (Q2392053) (← links)
- Hybrid statistical estimation of mutual information and its application to information flow (Q2414250) (← links)
- The meeting businessmen problem: requirements and limitations (Q2443007) (← links)
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms (Q2453112) (← links)
- Anonymity protocols as noisy channels (Q2482451) (← links)
- Provable unlinkability against traffic analysis with low message overhead (Q2516530) (← links)
- Worst- and average-case privacy breaches in randomization mechanisms (Q2517234) (← links)
- A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
- Network-Hiding Communication and Applications to Multi-party Protocols (Q2829220) (← links)
- Weak probabilistic anonymity (Q2864392) (← links)
- Beating the Birthday Paradox in Dining Cryptographer Networks (Q2946474) (← links)
- Dining Cryptographers with 0.924 Verifiable Collision Resolution (Q2960384) (← links)
- How to Brew-up a Refinement Ordering (Q2994493) (← links)
- Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic (Q3003427) (← links)
- Symbolic Model Checking the Knowledge in Herbivore Protocol (Q3003428) (← links)
- Formalization of Entropy Measures in HOL (Q3088009) (← links)
- Quantitative Information Flow and Applications to Differential Privacy (Q3092184) (← links)
- Knowledge and Action in Semi-public Environments (Q3093999) (← links)
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers (Q3184684) (← links)
- Beyond Knowing That: A New Generation of Epistemic Logics (Q3299590) (← links)
- A cryptographer's Conspiracy Santa (Q3305731) (← links)
- (Q3384082) (← links)
- Breaking Anonymity by Learning a Unique Minimum Hitting Set (Q3392966) (← links)
- Anonymous Communication and Anonymous Cash (Q3452339) (← links)
- Symbolic Model Checking for Dynamic Epistemic Logic (Q3457719) (← links)
- Secure Multi-party Shuffling (Q3460735) (← links)
- Information-Theoretic Security Without an Honest Majority (Q3498390) (← links)
- Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap (Q3498468) (← links)
- The Secret Santa Problem (Q3511435) (← links)
- Formal Semantics of a Dynamic Epistemic Logic for Describing Knowledge Properties of π-Calculus Processes (Q3582736) (← links)
- Anonymity Protocols as Noisy Channels (Q3608463) (← links)
- A Framework for Automatically Checking Anonymity with μCRL (Q3608464) (← links)
- Bisimulation for Demonic Schedulers (Q3617738) (← links)
- The Power of Anonymous Veto in Public Discussion (Q3627418) (← links)
- (Q4553277) (← links)
- Blind one-time signature and its applications (Q4821803) (← links)
- ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH (Q4903639) (← links)
- (Q5002833) (← links)
- CSP and anonymity (Q5096415) (← links)
- Unconditional Byzantine agreement for any number of faulty processors (Q5096793) (← links)
- Automatic verification of temporal-epistemic properties of cryptographic protocols (Q5188176) (← links)
