A Formal Treatment of Onion Routing
From MaRDI portal
Publication:5451025
DOI10.1007/11535218_11zbMATH Open1145.94460OpenAlexW2143215034MaRDI QIDQ5451025FDOQ5451025
Authors: Jan Camenisch, Anna Lysyanskaya 
Publication date: 17 March 2008
Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11535218_11
Recommendations
Cited In (31)
- Improving Efficiency and Simplicity of Tor Circuit Establishment and Hidden Services
- Klein Bottle Routing: An Alternative to Onion Routing and Mix Network
- Anonymity Protocols as Noisy Channels
- Title not available (Why is that?)
- Another look at anonymous communication. Security and modular constructions
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- Anonymous permutation routing
- Non-interactive anonymous router with quasi-linear router computation
- Onion routing with replies
- On evaluating anonymity of onion routing
- An analysis of trust in anonymity networks in the presence of adaptive attackers
- Poly onions: achieving anonymity in the presence of churn
- BackRef: accountability in anonymous communication networks
- cMix: mixing with minimal real-time asymmetric cryptographic operations
- A theory of composition for differential obliviousness
- Untagging Tor: a formal treatment of onion encryption
- A Model of Onion Routing with Provable Anonymity
- Identity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBE
- A formalization of anonymity and onion routing
- Practical and provably secure onion routing
- SOFSEM 2005: Theory and Practice of Computer Science
- Non-interactive anonymous router
- Title not available (Why is that?)
- Cryptographic shallots: a formal treatment of repliable onion encryption
- Provable unlinkability against traffic analysis with low message overhead
- Enabling scalable and unlinkable payment channel hubs with oblivious puzzle transfer
- Formal analysis of privacy for routing protocols in mobile ad hoc networks
- Generic constant-round oblivious sorting algorithm for MPC
- A universally composable framework for the privacy of email ecosystems
- Spreading the privacy blanket: differentially oblivious shuffling for differential privacy
- Conditional Probabilities over Probabilistic and Nondeterministic Systems
This page was built for publication: A Formal Treatment of Onion Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451025)
