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.
- Secret sets and applications (Q293178) (← links)
- Unconditionally secure quantum signatures (Q296340) (← links)
- A computationally grounded, weighted doxastic logic (Q310087) (← links)
- Abstraction for model checking multi-agent systems (Q352029) (← links)
- Comparative analysis of related notions of opacity in centralized and coordinated architectures (Q373013) (← links)
- A cooperative quantum anonymous transmission with hybrid entanglement swapping (Q382811) (← links)
- Compositional noninterference from first principles (Q432152) (← links)
- Quantum anonymous voting with anonymity check (Q432877) (← links)
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- Verification of initial-state opacity in security applications of discrete event systems (Q497279) (← links)
- Analyzing anonymity attacks through noisy channels (Q498398) (← links)
- An anonymous surveying protocol via Greenberger-Horne-Zeilinger states (Q517853) (← links)
- Information hiding in probabilistic concurrent systems (Q549174) (← links)
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- \(k\)-anonymous data collection (Q730905) (← links)
- The design of a secure and fair sealed-bid auction service (Q814236) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- Probable innocence revisited (Q860902) (← links)
- Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- The shadow knows: refinement and security in sequential programs (Q923889) (← links)
- Probabilistic anonymity via coalgebraic simulations (Q974115) (← links)
- Making random choices invisible to the scheduler (Q979081) (← links)
- A one-round secure message broadcasting protocol through a key sharing tree (Q989505) (← links)
- Summing over a network without revealing summands (Q1119609) (← links)
- Topology-hiding computation beyond semi-honest adversaries (Q1631311) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security (Q1633451) (← links)
- Practical verification of multi-agent systems against \textsc{Slk} specifications (Q1641030) (← links)
- Information theoretical cryptogenography (Q1698396) (← links)
- Verification and control of partially observable probabilistic systems (Q1699230) (← links)
- A universally composable framework for the privacy of email ecosystems (Q1710670) (← links)
- Opacity for linear constraint Markov chains (Q1745942) (← links)
- Conditional anonymity with non-probabilistic adversary (Q1750044) (← links)
- New bounds for randomized busing (Q1770380) (← links)
- An efficient protocol for anonymous multicast and reception. (Q1853191) (← links)
- A practical anonymous payment scheme for electronic commerce (Q1876490) (← links)
- Security invariants in discrete transition systems (Q1941889) (← links)
- Quantum private communication with an anonymous sender (Q1945409) (← links)
- Towards quantum-based privacy and voting (Q1957433) (← links)
- Abstractions of non-interference security: probabilistic versus possibilistic (Q2018754) (← links)
- An algebraic approach for reasoning about information flow (Q2024334) (← links)
- Positive announcements (Q2046881) (← links)
- Non-interactive anonymous router (Q2056804) (← links)
- Spreading the privacy blanket: differentially oblivious shuffling for differential privacy (Q2096625) (← links)
- A new post-quantum voting protocol based on physical laws (Q2101594) (← links)
- Practical anonymous entanglement with noisy measurement (Q2102264) (← links)
- Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
- A better composition operator for quantitative information flow analyses (Q2167722) (← links)
