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 21 items.
- A quantitative doxastic logic for probabilistic processes and applications to information-hiding (Q5188177) (← links)
- Location Privacy in WSNs: Solutions, Challenges, and Future Trends (Q5253593) (← links)
- ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS’ PROTOCOL (Q5402657) (← links)
- Conditional Probabilities over Probabilistic and Nondeterministic Systems (Q5458326) (← links)
- Compositional Methods for Information-Hiding (Q5458378) (← links)
- Anonymous Quantum Communication (Q5900022) (← links)
- Regular model checking revisited (Q6045028) (← links)
- Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730) (← links)
- An automated quantitative information flow analysis for concurrent programs (Q6103027) (← links)
- \(\log^\ast\)-round game-theoretically-fair leader election (Q6108988) (← links)
- Exploiting Asymmetry in Logic Puzzles: Using ZDDs for Symbolic Model Checking Dynamic Epistemic Logic (Q6118728) (← links)
- State-based opacity of labeled real-time automata (Q6122597) (← links)
- Tight bounds on the randomness complexity of secure multiparty computation (Q6166963) (← links)
- Anonymous whistleblowing over authenticated channels (Q6169427) (← links)
- Program semantics and verification technique for AI-centred programs (Q6174548) (← links)
- Statistical Model Checking for Probabilistic Hyperproperties of Real-Valued Signals (Q6487300) (← links)
- Provably secure group authentication in the asynchronous communication model (Q6536218) (← links)
- Lower bounds on anonymous whistleblowing (Q6582209) (← links)
- Non-interactive anonymous router with quasi-linear router computation (Q6582211) (← links)
- On evaluating anonymity of onion routing (Q6618579) (← links)
- Synergistic knowledge (Q6652434) (← links)
