<?xml version="1.0" encoding="UTF-8"?>
<XML><RECORDS>
<RECORD>
	<REFERENCE_TYPE>15</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Igor Margasinski</AUTHOR>
	</AUTHORS>
	<YEAR>2007</YEAR>
	<TITLE>A Method for an Anonymous and Direct Data Sending in Telecommunications Network</TITLE>
	<PLACE_PUBLISHED>Poland</PLACE_PUBLISHED>
	<PUBLISHER>Warsaw University of Technology</PUBLISHER>
	<DATE>12/2007</DATE>
	<NOTES>Patent application is currently under PPO revision.<br>
Polish title: SposÃ³b anonimowego i bezpoÅ›redniego przesyÅ‚u danych w sieci telekomunikacyjnej.</NOTES>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>10</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Igor Margasinski</AUTHOR>
	</AUTHORS>
	<YEAR>2007</YEAR>
	<TITLE>P2PRIV: Peer-to-Peer Direct and Anonymous Distribution Overlay</TITLE>
	<SECONDARY_TITLE>Department of Computer Networks and Switching (ZTiT), Warsaw University of Technology</SECONDARY_TITLE>
	<PLACE_PUBLISHED>Warszawa</PLACE_PUBLISHED>
	<PUBLISHER>Institute of Telecommunications, WUT</PUBLISHER>
	<DATE>09/2007</DATE>
	<NOTES>ZTiT Internal Technical Report.</NOTES>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>31</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Igor Margasinski</AUTHOR>
		<AUTHOR>Michal Pioro</AUTHOR>
	</AUTHORS>
	<YEAR>2008</YEAR>
	<TITLE>A Concept of an Anonymous Direct P2P Distribution Overlay System</TITLE>
	<SECONDARY_TITLE>IEEE 22nd International Conference on Advanced Information Networking and Applications (AINA)</SECONDARY_TITLE>
	<PLACE_PUBLISHED>Gino-wan, Okinawa, Japan</PLACE_PUBLISHED>
	<PUBLISHER>IEEE Computer Society Press</PUBLISHER>
	<PAGES>590-597</PAGES>
	<DATE>25/03/2008</DATE>
	<ISBN>978-0-7695-3095-6</ISBN>
	<KEYWORDS>
		<KEYWORD>Communication</KEYWORD>
		<KEYWORD>system</KEYWORD>
		<KEYWORD>security,</KEYWORD>
		<KEYWORD>communication</KEYWORD>
		<KEYWORD>system</KEYWORD>
		<KEYWORD>traffic,</KEYWORD>
		<KEYWORD>privacy</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>The paper introduces a peer-to-peer system called P2PRIV (peer-to-peer direct and anonymous distribution overlay). Basic novel features of P2PRIV are: (i) a peer-to-peer parallel content exchange architecture, and (ii) separation of the anonymization process from the transport function. These features allow a considerable saving of service time while preserving high degree of anonymity. In the paper we evaluate anonymity measures of P2PRIV (using a normalized entropy measurement model) as well as its traffic measures (including service time and network dynamics), and compare anonymity and traffic performance of P2PRIV with a well known system called CROWDS. </ABSTRACT>
	<URL>http://p2priv.org/pub/p2priv-aina2008.pdf</URL>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>0</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Igor Margasinski</AUTHOR>
		<AUTHOR>Michal Pioro</AUTHOR>
	</AUTHORS>
	<YEAR>2008</YEAR>
	<TITLE>Low-Latency Parallel Transport in Anonymous Peer-to-Peer Overlays</TITLE>
	<SECONDARY_AUTHORS>
		<SECONDARY_AUTHOR>N. Akar, et al.</SECONDARY_AUTHOR>
	</SECONDARY_AUTHORS>
	<SECONDARY_TITLE>IP Operations and Management</SECONDARY_TITLE>
	<PUBLISHER>Springer Berlin / Heidelberg</PUBLISHER>
	<VOLUME>LNCS 5275</VOLUME>
	<PAGES>127-141</PAGES>
	<TERTIARY_TITLE>Lecture Notes in Computer Science</TERTIARY_TITLE>
	<DATE>12/2008</DATE>
	<ISBN>978-3-540-87356-3</ISBN>
	<KEYWORDS>
		<KEYWORD>Communication</KEYWORD>
		<KEYWORD>system</KEYWORD>
		<KEYWORD>traffic,</KEYWORD>
		<KEYWORD>communication</KEYWORD>
		<KEYWORD>system</KEYWORD>
		<KEYWORD>security,</KEYWORD>
		<KEYWORD>privacy,</KEYWORD>
		<KEYWORD>peer-to-peer</KEYWORD>
		<KEYWORD>overlays,</KEYWORD>
		<KEYWORD>overlay</KEYWORD>
		<KEYWORD>networks</KEYWORD>
		<KEYWORD>management</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>The paper presents a design and discusses configuration aspects of an overlay transport protocol based on an idea of the peer-to-peer direct and anonymous distribution overlay (P2PRIV). We estimate a secure configuration of the protocol and examine a correlation between the P2PRIV's anonymous path lengths and latency. An increase of the path lengths speaks strongly in favor of the parallel solution&acirc;€™s anonymity, as in classical cascade networks. In the paper we evaluate the new protocol in a scope of a trade-off between anonymity and traffic performance and show that the presented solution allows effectively increasing anonymity with relatively low impact on anonymous transport latency.</ABSTRACT>
	<URL>http://p2priv.org/pub/p2priv-transport-ipom2008.pdf</URL>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>31</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Igor Margasinski</AUTHOR>
		<AUTHOR>Michal Pioro</AUTHOR>
	</AUTHORS>
	<YEAR>2008</YEAR>
	<TITLE>On Traffic Performance Measures for Anonymous P2P Networks</TITLE>
	<SECONDARY_AUTHORS>
		<SECONDARY_AUTHOR>A. Feldmann, et al.</SECONDARY_AUTHOR>
	</SECONDARY_AUTHORS>
	<SECONDARY_TITLE>The Fifth Polish-German Teletraffic Symposium (PGTS'08)</SECONDARY_TITLE>
	<PLACE_PUBLISHED>Technische UniversitÃ¤t Berlin, Germany</PLACE_PUBLISHED>
	<PUBLISHER>Logos Verlag Berlin</PUBLISHER>
	<PAGES>129-138</PAGES>
	<DATE>06/10/2008</DATE>
	<ISBN>978-3-8325-2047-2</ISBN>
	<KEYWORDS>
		<KEYWORD>Communication</KEYWORD>
		<KEYWORD>system</KEYWORD>
		<KEYWORD>traffic,</KEYWORD>
		<KEYWORD>traffic</KEYWORD>
		<KEYWORD>modeling,</KEYWORD>
		<KEYWORD>anonymous</KEYWORD>
		<KEYWORD>peer-to-peer</KEYWORD>
		<KEYWORD>networks</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>The modeling of anonymous systems is mostly aimed at the evaluation of the level of provided anonymity. However, the utility of anonymity solutions depends not only on their security, but also on necessary traffic overheads. In this paper, we have proposed an empirical, traffic performance model for anonymous P2P networks. We based our research on a well known information entropy measurement
model for an estimate of secure configuration of anonymous forwarding path lengths. Then, we proposed a simulation-based methodology for an evaluation of latency and dynamics of the selected configurations. As an example we used the classical system called CROWDS. We evaluate traffic performance of CROWDS and show that the empirical analysis of the system has been analogous to results obtained analytically for representative boundary conditions.</ABSTRACT>
	<URL>http://p2priv.org/pub/on-traffic-performance-measures-anon-p2p-pgts2008.pdf</URL>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>31</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Igor Margasinski</AUTHOR>
	</AUTHORS>
	<YEAR>2009</YEAR>
	<TITLE>A Parallelism-Based Approach to Network Anonymization</TITLE>
	<SECONDARY_AUTHORS>
		<SECONDARY_AUTHOR>Audun Jøsang</SECONDARY_AUTHOR>
		<SECONDARY_AUTHOR>Torleiv Maseng</SECONDARY_AUTHOR>
		<SECONDARY_AUTHOR>Svein J. Knapskog</SECONDARY_AUTHOR>
	</SECONDARY_AUTHORS>
	<SECONDARY_TITLE>Identity and Privacy in the Internet Age</SECONDARY_TITLE>
	<PUBLISHER>Springer-Verlag</PUBLISHER>
	<VOLUME>5838</VOLUME>
	<PAGES>28-43</PAGES>
	<TERTIARY_TITLE>Lecture Notes in Computer Science</TERTIARY_TITLE>
	<ISBN>978-3-642-04765-7</ISBN>
	<KEYWORDS>
		<KEYWORD>communication</KEYWORD>
		<KEYWORD>systems</KEYWORD>
		<KEYWORD>security,</KEYWORD>
		<KEYWORD>privacy,</KEYWORD>
		<KEYWORD>anonymity,</KEYWORD>
		<KEYWORD>anonymous</KEYWORD>
		<KEYWORD>network</KEYWORD>
		<KEYWORD>architectures</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>Considering topologies of anonymous networks we used to organizing anonymous communication into hard to trace paths hiding its origin or destination. In anonymity the company is crucial, however the serial transportation imposes a costly tradeoff between a level of privacy and a speed of communication. 
In this paper a framework of a novel architecture for anonymous networks is introduced that hides initiators of communications by parallelization of anonymous links. The new approach, which is based on the grounds of the anonymous P2P network called P2Priv, does not require content forwarding via a chain of proxy nodes to assure high degree of anonymity. Contrary to P2Priv, the new architecture can be suited to anonymization of various network communications, including anonymous access to distributed as well as client-server services. In particular, it can be considered as an anonymization platform for these network applications where both privacy and low delays are required.</ABSTRACT>
	<URL>http://p2priv.org/pub/netpriv-nordsec2009.pdf</URL>
</RECORD>
</RECORDS></XML>