Pages that link to "Item:Q5248538"
From MaRDI portal
The following pages link to Cryptographic defense against traffic analysis (Q5248538):
Displaying 17 items.
- The dining cryptographers problem: Unconditional sender and recipient untraceability (Q1109008) (← links)
- Buses for anonymous message delivery (Q1402361) (← links)
- Shuffling large decks of cards and the Bernoulli-Laplace urn model (Q1721921) (← links)
- New bounds for randomized busing (Q1770380) (← links)
- An efficient protocol for anonymous multicast and reception. (Q1853191) (← links)
- Private authentication (Q1881255) (← links)
- Provable unlinkability against traffic analysis with low message overhead (Q2516530) (← links)
- An Entropy Based Encrypted Traffic Classifier (Q2801779) (← links)
- Anonymous Communication and Anonymous Cash (Q3452339) (← links)
- Secure Multi-party Shuffling (Q3460735) (← links)
- Unconditional sender and recipient untraceability in spite of active attacks (Q3973157) (← links)
- Financial Cryptography (Q4680927) (← links)
- (Q5002833) (← links)
- Information Security (Q5492780) (← links)
- The effect of false positives: Why fuzzy message detection leads to fuzzy privacy guarantees? (Q6045195) (← links)
- Poly onions: achieving anonymity in the presence of churn (Q6169429) (← links)
- Instantiability of classical random-oracle-model encryption transforms (Q6175981) (← links)