4 Search Results for "Scheuermann, Björn"

Document
DOI: 10.4230/OASIcs.NINeS.2026.17
Don’t Get Caught, Keep Your Onions in a Vault

Authors: Humza Ikram, Rumaisa Habib, Muaz Ali, and Zartash Afzal Uzmi

Published in: OASIcs, Volume 139, 1st New Ideas in Networked Systems (NINeS 2026)

Abstract
When web applications wish to operate anonymously, they routinely host themselves as "Hidden Services" in the Tor network. However, these services are frequently threatened by deanonymization attacks, whereby their IP address and location may be inferred by the authorities. We present VaulTor, a novel architecture for the Tor network that ensures an extra layer of security for the Hidden Services against deanonymization attacks. In this new architecture, a volunteer (vault) is incentivized to host the web application content on behalf of the Hidden Service. The vault runs the hosted application in a Trusted Execution Environment (TEE) and becomes the point of contact for interested clients. This setup can substantially reduce the uptime requirement of the original Hidden Service provider, thereby significantly decreasing the chance of deanonymization attacks against them. Using a vault node in place of the hidden service node does not cause any noticeable performance degradation when accessing the hosted content.
Cite as

Humza Ikram, Rumaisa Habib, Muaz Ali, and Zartash Afzal Uzmi. Don’t Get Caught, Keep Your Onions in a Vault. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 17:1-17:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{ikram_et_al:OASIcs.NINeS.2026.17,
  author =	{Ikram, Humza and Habib, Rumaisa and Ali, Muaz and Uzmi, Zartash Afzal},
  title =	{{Don’t Get Caught, Keep Your Onions in a Vault}},
  booktitle =	{1st New Ideas in Networked Systems (NINeS 2026)},
  pages =	{17:1--17:24},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-414-7},
  ISSN =	{2190-6807},
  year =	{2026},
  volume =	{139},
  editor =	{Argyraki, Katerina and Panda, Aurojit},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.NINeS.2026.17},
  URN =		{urn:nbn:de:0030-drops-256027},
  doi =		{10.4230/OASIcs.NINeS.2026.17},
  annote =	{Keywords: Tor, anonymity, Hidden Services, Trusted Execution Environments}
}
Document
DOI: 10.4230/OASIcs.KiVS.2011.121
Supporting Cooperative Traffic Information Systems through Street-Graph-based Peer-to-Peer Networks

Authors: Jedrzej Rybicki, Benjamin Pesch, Martin Mauve, and Björn Scheuermann

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

Abstract
In this paper we present a novel peer-to-peer system specifically designed to support the unique properties of traffic information systems. We discuss important design decisions, such as update strategies and algorithms for dynamic vehicular route planning. Our system is then assessed using a combination of network (OverSim/OMNeT++) and road traffic (SUMO) simulators. We discuss the network load required by our system and show the benefits—in terms of travel time savings—that users can expect from it.
Cite as

Jedrzej Rybicki, Benjamin Pesch, Martin Mauve, and Björn Scheuermann. Supporting Cooperative Traffic Information Systems through Street-Graph-based Peer-to-Peer Networks. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 121-132, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{rybicki_et_al:OASIcs.KiVS.2011.121,
  author =	{Rybicki, Jedrzej and Pesch, Benjamin and Mauve, Martin and Scheuermann, Bj\"{o}rn},
  title =	{{Supporting Cooperative Traffic Information Systems through Street-Graph-based Peer-to-Peer Networks}},
  booktitle =	{17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
  pages =	{121--132},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-27-9},
  ISSN =	{2190-6807},
  year =	{2011},
  volume =	{17},
  editor =	{Luttenberger, Norbert and Peters, Hagen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.121},
  URN =		{urn:nbn:de:0030-drops-29639},
  doi =		{10.4230/OASIcs.KiVS.2011.121},
  annote =	{Keywords: Peer-to-Peer, traffic information systems, network simulators}
}
Document
DOI: 10.4230/OASIcs.KiVS.2011.133
Distributed Probabilistic Network Traffic Measurements

Authors: Alexander Marold, Peter Lieven, and Björn Scheuermann

Published in: OASIcs, Volume 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)

Abstract
Measuring the per-flow traffic in large networks is very challenging due to the high performance requirements on the one hand, and due to the necessity to merge locally recorded data from multiple routers in order to obtain network-wide statistics on the other hand. The latter is nontrivial because traffic that traversed more than one measurement point must only be counted once, which requires duplicate-insensitive distributed counting mechanisms. Sampling-based traffic accounting as implemented in today’s routers results in large approximation errors, and does not allow for merging information from multiple points in the network into network-wide total traffic statistics. Here, we present Distributed Probabilistic Counting (DPC), an algorithm to obtain duplicate-insensitive distributed per-flow traffic statistics based on a probabilistic counting technique. DPC is structurally simple, very fast, and highly parallelizable, and therefore allows for efficient implementations in software and hardware. At the same time it provides very accurate traffic statistics, as we demonstrate based on both artificial and real-world traffic data.
Cite as

Alexander Marold, Peter Lieven, and Björn Scheuermann. Distributed Probabilistic Network Traffic Measurements. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 133-144, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{marold_et_al:OASIcs.KiVS.2011.133,
  author =	{Marold, Alexander and Lieven, Peter and Scheuermann, Bj\"{o}rn},
  title =	{{Distributed Probabilistic Network Traffic Measurements}},
  booktitle =	{17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)},
  pages =	{133--144},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-27-9},
  ISSN =	{2190-6807},
  year =	{2011},
  volume =	{17},
  editor =	{Luttenberger, Norbert and Peters, Hagen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.KiVS.2011.133},
  URN =		{urn:nbn:de:0030-drops-29648},
  doi =		{10.4230/OASIcs.KiVS.2011.133},
  annote =	{Keywords: network measurement, flow monitoring, probabilistic techniques}
}
Document
DOI: 10.4230/DagSemProc.10402.3
10402 Report – Working Group on Fundamental Limits and Opportunities

Authors: Hannes Hartenstein, Geert Heijenk, Martin Mauve, Björn Scheuermann, and Lars Wolf

Published in: Dagstuhl Seminar Proceedings, Volume 10402, Inter-Vehicular Communication (2011)

Abstract
This working group investigated first steps towards finding a theoretical foundation for inter-vehicle communication. The main outcome is a sketch of a roadmap for future work in this direction.
Cite as

Hannes Hartenstein, Geert Heijenk, Martin Mauve, Björn Scheuermann, and Lars Wolf. 10402 Report – Working Group on Fundamental Limits and Opportunities. In Inter-Vehicular Communication. Dagstuhl Seminar Proceedings, Volume 10402, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{hartenstein_et_al:DagSemProc.10402.3,
  author =	{Hartenstein, Hannes and Heijenk, Geert and Mauve, Martin and Scheuermann, Bj\"{o}rn and Wolf, Lars},
  title =	{{10402 Report – Working Group on Fundamental Limits and Opportunities}},
  booktitle =	{Inter-Vehicular Communication},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2011},
  volume =	{10402},
  editor =	{Falko Dressler and Frank Kargl and J\"{o}rg Ott and Ozan K. Tonguz and Lars Wischhof},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10402.3},
  URN =		{urn:nbn:de:0030-drops-29266},
  doi =		{10.4230/DagSemProc.10402.3},
  annote =	{Keywords: Inter-Vehicle Communication, Car-to-X Communication, Fundamental Limits}
}
  • Refine by Type
  • 4 Document/PDF
  • 1 Document/HTML

  • Refine by Publication Year
  • 1 2026
  • 3 2011

  • Refine by Author
  • 3 Scheuermann, Björn
  • 2 Mauve, Martin
  • 1 Ali, Muaz
  • 1 Habib, Rumaisa
  • 1 Hartenstein, Hannes
  • Show More...

  • Refine by Series/Journal
  • 3 OASIcs
  • 1 DagSemProc

  • Refine by Classification
  • 1 Security and privacy → Pseudonymity, anonymity and untraceability

  • Refine by Keyword
  • 1 Car-to-X Communication
  • 1 Fundamental Limits
  • 1 Hidden Services
  • 1 Inter-Vehicle Communication
  • 1 Peer-to-Peer
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact