Bestand wählen
Merken

How Alice and Bob meet if they don't like onions

Zitierlink des Filmsegments
Embed Code

Automatisierte Medienanalyse

Beta
Erkannte Entitäten
Sprachtranskript
and that was the
end of the and and the and
the and so you only toward the right it's really Boston tools for anonymous can communication that sometimes sadly it just doesn't work for the use case you have maybe you need more languages and the so this is what this so let's go either other options in the realm of and 9 other anonymization networks so we have areas you know and a little bit different from what was the nodes in the schedule that this is carried out and then he will give you told how Alice and Bob need if they don't like onions please let them have high my name is Eric Meyer recommended to my talk me I'm from the University of from local from the group security and privacy that we all have a long tradition in researching in 2 anonymization methods especially you don't need know where my proposal proposal for the rope has some experience and for what let's say that 15 to to 20 years some let's
have a look at the agenda of forums them this talk 1st of all we to lose some basics about the anonymity and strategies to achieve anonymity the way we look at the different adversaries and afterward so we have a look at the practical and the anonymous communication networks especially high to be free net no net and only afterward so we only have 1 for a short period looking into the current research work and conclude the talk so what
is anonymity anonymity is the state that it would have being is not identify a viable within a certain set that within a certain group abandoning
the anonymity set yeah uh we see on the left side the Alice and she is referring anonymity set of descendants NASA will send the traffic to what's and in the middle of the ACM and among the anonymous communication network so In
the same as the leader of the bomb is the same as the little block a year's worth in as and of of potential recipients and and therefore the key here also can achieve some recipient anonymity then there's
also the options that both of the sides of the hacienda are anonymous in this case we speak of a 7 recipient anonymity
so and and there there's also the property of unlinkability which describes that there are some items of interest which an attacker is not able to you want to work let the sufficiently distinguish where aware that these 2 objects are linked or related to each other because
this relationship anonymity if there there take out with the red tent is not able to distinguish whether the messages which are of a standard Viterbi Alice to what's uh ACM and received by about whether these are related or not In this case so that they can be linked to but that there
also the case that they cannot be linked and a lot like at this attack at you can do some traffic analysis and the tries to recognize patterns and the size of the packets on the timing of the packets was like it some aggregated measures like like the uh you as a band of consumption of the entire session it was like from the content of the messages so that's an
important question when we talk about anonymity is will do you trust and that means that there are
different strategies to words anonymity of uh tried to establish processes and like for for example that this is the strategy of a comeback traffic that you send someone wrote of yeah random traffic to hide your uh and quite successful as broadcasting messages that you know that you send a message not to to 1 recipient of but too well recipients but only the true recipient of let's say ball is able to over decrypt the message then you can also use a trusted 3rd party or what what this usually of VPN or a proxy about if you you have to get it depends on the trust model as if your final of crossing of and uh you know and then you you can achieve some sort of anonymity perspective then the lid on their really also have a slide for this like that in the shuffling and delaying laying off message that were which so discovered by makes the comics as well like that and world anonymous remain and that means that there are different anonymity systems and they tried to distribute trust that you will not have to trust a single entity but there you can trust like the different parties now they do it by using secure multiparty computation and that it is a cryptographically scheme which is use the in and the DC nets and assistance for the learning curve probably were 1st then a cascade of makes this a literature which at quite a because we we will see me on that later on and on in routing garlic doing I'm going to you should ensure that also work
on an extra slide so here various see the basic principle of our 1 not make sense we see in the that it shall use sends a message to what some makes and listens to 2 messages to work to mix and they have a certain order the order is like Chinese message that arrives the 1st and then afterward so those of a list rule and uh this orange 1 and and the the makes can have like a threshold that to OK I remember so that I know I'm only able to catch 3 messages and and then a few shuffled so the messages and after the break with the threshold association and this sense mild in different the order and the different the new and there were some latency so dead and then out will observe so here the left and the right side that has some difficulties to link that the mayor of messages that with each other no on
in routing as explained on the schemes and I think if you are quite similar restore your your weren't know at this so you have to understand and the receiver and sends a message of religious and put the 2 of the 3 layers of encryption and then we receive 3 notes and a see and and and the probability or the messages encrypted towards the probability note that in the degree node and the blue node and then Y and the picket uh whole term propagates through the and uh lose a single layer of encryption are removed by the notes the so that a pompous also getting the message as expected so we got
according to the world which is used by i 2 p this uh bit said here and and there there's some parts in common refining rotting but there are also some quite some stuff different the so 1st of all the comparison to the earlier slide so we we have a peer-to-peer architecture that means and that a list a wants to send a message can also be used by other notes about other peers to relay messages were from the network the so as she is actively taking part in the the then there's the the has an outbound will which you see the uh concoct in which the ruling lines and pop hasn't been long time so so uh what we see is that the standards or standards and they they are unidirectional uh so my messages can only go through in 1 direction and the special rule for organic encryption this and that messages that can be abundant but a similar like a garlic clove road where you have like more multiple parts and the soul lives can enter and encrypted messages to block or allelic would've met messages to Bob religious afterward savings some advantage well when Bob so acknowledged that he received the message the only assistant of for 1 time in multiple times so and then the the black link there it's like uh the uh you know uh it's a connection between like the Ellis outbound and tunnel and the box and bounded conjugate rate uh that that this like the 1st node of Bob Bob says and ontology and this node to that X yeah listed that doesn't know what the real identity or the real address of popular and she only knows student and on time the Gatorade were which is the 1st note of the time with and and between them and these notes of the time but there's also on in on an encryption used the to so let's have a look
at that groceries I think my memory
you also need to know them from your computer science class uh so that under this external anniversary issue is not taking part in the network I can only observe the traffic will which is going through the then we have the internal anniversary will which is able to get the knowledge of will from the NetDirector like a which appears participating in some and encryption keys so all whatever I guess is uh and in additional also known and also which messages of for audio and in this way so and then we have to test this address 3 which is just just looking at the things so which are passing back and uh we have effective across 3 will which a cell able to modify it thinks a lot like you can delete messages you can modify them also and this additional messages then we have to look at the grocery who which is only present in a small the bottom part of the network what will we have to the global adversary world which is that controlling the Internet for often the reuse of the global impact of of of our work which is like of observing all the traffic watches throwing off in the OK now let's
go to the interesting part of the talk uh so uh there however they did read and select the networks that were which the world which we assume right like a we have we have a look at what what is there and as we noted or notice that there are a lot of things so will which are not and I than other implemented or they are not functioning well law and that there is indeed it's not practical to use and then we notice that that there of form and that Drexel with which uh except from 2 of the former Drexel were which I will local pride aware of quite easy to use then that that they have some active development which are joined the name 3 net community and I to p and the lid on the mirror in this form for the research project we just thought OK what what might be interesting that they're actually too many of them and then we we just take the sum over which seems to me to be
interesting to so author of 1st of all let's have a look at that I to be i to be it's low latency in uh low-delay latency peer-to-peer networks will flow of approximately issue 70 thousand notes in comparison to the Torah Lacerta has around about 7 thousand nodes and I 2 p all it's regarding the nodes and that every relay or every peers also allow like an order in this case the here and it's a larger the taught in general has a more users of a few millions so uh I 2 and that does that focus on hidden services the soul and it's not intended to use like it alleges the then allow like you another and a EU and that there are a few of proxies so you you can access a summer normal websites lower which like Tiger so or whatever uh but this actually it's not intended to be used in that way so to begin like PI applications a peer-to-peer applications which includes like power sharing a the torrent uh that browsing and then e-mail instant messaging C and 5 selection the community of our 2 p is quite active and then they released during the last years like every 2 every 2 months and then and the output of and new release the so
here we see a how well is a ball a meeting or not to be here in the sparse are the noughts of the economy and it's a not necessary that that there are just 3 notes you actually everybody and every peer can decide how many nodes that he wants to have more she wants to have so what we see in the and then the size of the box shows that you were were there an encryption layer is removed all were well aware that the said it so we see that outbound tunnel so removes encryption layers the non-tonal again at its at and we see that that for got according to we need to like to uh to rule yeah links the was like at every participant than needs at least 2 2 tunnels 1 unknown and 1 outbound tunnel for successful communication similar to talk at the lifetime of uh tunnel limited all the marbles limiting their the lifetime to 10 minutes
so I had to be in the hell out of sight of the use of the bootstrapping problem yeah uh boots and peer-to-peer networks have a problem of how would they find out that would say that already and participating in the network so the I 2 p and also free now the internet would surely we will investigate later and that the use or they download public sources and who will which is hard coded in the software and their their don't load this summer active so or a list of some active fused and afterwards then and afterward say can move take part in the network min as especially about appears and that that every node the local collects local-statistic aboard or that the notes and what will which is uh use little later on when when he wants to build it has has fallen on hard times and yeah here you can choose and to just use the word performing notes and to establish a the beside the inbound and outbound tunnel and they're also exploratory permits used now to be but which are in the source of the purposes to build manage and destroy the other planets so that this can be done anonymously and it's being done by the descending a tunnel construction request over the exploratory tunnel and the and then further at the appear accepts to take part in the standard that is symmetric keys are exchanged and the afterlife a list of found the success of this note there is seeking and send to this remote node to and the success addressed for the time so how
does a list get the contact information of what In and there and this and then that would be best or especially true data structures so from the uh and I to be which is the wrought iron full and then the set and the and full uh information about the each period where the and the public key is saved identifiers save the contact information like the involvement of internal get states and then he said this is the use of a room and you on operate services were finite appear in services and then you can publish these and on time and time again raise a uh year which are called listed and then this information to our moon uh our collected thereby it's about peers what's often appears as they're called and to be and do you have to do this is a distributed hash table the network database wanted to be a so I had to peer but protects and the information which PL by operates as certain service and there was some previous knowledge about popular let's say as well and you you can contact and 1 but I have to be set to 0 you know some like is identified and then you can request uh DB
and on contact so let's have a look at Trinity notice also the peer-to-peer network uh it's a smaller that's wrong about 10 thousand notes and it's the focuses on distributed information information storage the so it's actively developed since 2001 and then there is added the option a friend to friend to bone topology sold that you think you can decide whether you want trust your friends and and and that's like a white list uh there's a white list to which appears you want to well connected and to begin applications for offering about my storage as a static webpage said in social
yeah so let's have a look at how like Alice and Bob meet their received that then that there old candidates and and there's also no warning encryption involved in free so the it's like this said Elisa asking her neighbor bound for for a certain information and in the neighborhood of like that and so she has a key role for information she's looking looking for and the thing than in the neighborhood of and the Dassault in this case it doesn't have the information and enable as next role rather than this neighbor has information and the yeah replies no I don't have this information and meet and then again and the the the younger than explodes ask and uh human real we see finally after we follow all the links will we see that the ball of what's only 1 who replied that he had this information and there was a link number 10 that he is sending and this information doing towards Ellis and he's not sending this information directly but sending as and this by the dark red and the green note note and the 1 will work but it's a special about it if we know you you might assume OK this is rather an effective that would be much more effective if you would send it straight to Alice but there by this also a plausible deniability associated in that the the like at the backward nodes of we make a go of like like in its uh he also gets that information and the the then the above from foreign it's more difficult to to decide OK red and the and this information come from and rendered has been sent to the citizens also a lot of other uh notes are getting this information and the anonymity said and the like the blonde potential recipients of this in this way increase and and and uh and this peer-to-peer network that does that and that's distributed information storage and that if you request that information and that was uh uh replies successful and then that the notes on the green part of that they're catching and that information the so added that when Alice for for the next time after like of for example the green note that do do you have this information then then this node can already serve this information and bound by this method this information with which is once said send to the Freenet but it's like a censorship resistant cast by the notes and the Milan like a fair and Bob we would be the publisher you would have no option to delete this message after what's and the messages hourly deleted like if they are going to do this they're too old to wear when they have not been requested for a long time and so the catch up meaning that they are removed from the cash and each node in the phonetic provides a few world you by 2 about and to to move the network and to store such
information connected it's a very very similar to free not that bad but they do matter but there's also some pattern and designate from foundation were which also intends to develop an alternative and that the expected know where where you also have this a hop-by-hop Mycteria picture topology so the primary application of also has origin fracturing it's a similar to free not uh but that has an economic the inspired trust model so relay is they can and can't do decide whether whether they want to follow what a message toward to 1 0 2 0 2 1 multiple nodes and and there is also the option to trade the anonymity of of this efficiency is identical tool-free net that that's also a different to friends of options available for you on the trust and the difference you already know so have a
look at how this works here where we say and see that Ellissa's sending a request to the proper note and the public no to the latter like this is all of them pink link in the of pink link and they're they're this starts and that she's she's sending a request to about note the and the probability of a node for what's this request to launch note and then what the verbal note that this and that you replace the reply address will which lists and lists and send her own address at the reply addressed by and the address of the purple we we see it there that the orange note it's not doing this and then this is why the link apartment this here if you did doesn't touch the reply address and so ball and that that's uh centered at the message not to the orange note about the to the note and and this really have a we have no warning no more no less and then this past and the and and this very candid trade anonymity of over this efficiency so new
it's another and and that work with its of focuses on alleges the and then the soul of that there are no hidden services available within the in uh Germany numerous also known as the environment poxy order yup and so hasn't been research but on project so and really bad semantic and the back and a special about Germany Mr. provide a model and the that then there there's so on the 1 side and premium services where users have to pay for a 1st of all the other of the metrics and it's for free a lot like you the usage of NGOs that forces for free or you can choose also going to want to have the free exercise to dominant in love but they're not that you only have to relate so 2 hops in cascade and to the and for the pure model you would have 3 but and what what what is different the regarding the provider model this that and the operators as an unknown and then that that there approved by the by the company John the need and the Argentina has thousand paying users
so many let's have a look at a dominant John use of fuelwood cascades and the path is the predetermined so high that you use to gray cascade degree in cascade of the brick escaped from the there there is no other option than to buy like but by the same not decide at which router Hewish she wants to take a lot like it would be possible and I 2 p and uh and control and John and you has to services and for service will which is providing the user with some performance information about the cascades on many users so you using this cascade uh my how many events of this still available at the end there's a billing service the following yeah and so what is special about John Lehman this and that that and that the wall and you see and this is like for for example the Great Firewall of China that that that you you a and that some the sent connection and you are not allowed to to will you want to connect to draw new and did you see that there a both the blue guys and that there is so when there are some black arrows and then this and the of uh this John in application you have the option and that that you allow other users to know that that you share bandwidth through fiber users in cases their sense of and so now all the when there are the who died so we were aware and arrows both uh as proxying and the other users to a cascade and so that they can avoid that that's censorship doing so from because it's
quite unique to to have uh have payment service and have a look at this and so would you see and then that Allison units that too whereby by some traffic and then this information is provided to the mix cascade that and the mayor mix cascade the checks the billing service at whether this had the paint and do the billing methods of our in a class like an anonymous pay will fall you can't send because by but also so some of them are not at the anonymous so form selecting transfer this possible which I'm I'm I'm I did not then the
interests of somebody wants to stay in the anonymous yeah to so uh let's
let's and compare the these services while and in the 2 systems so we can state that of these practical anonymity Inc. torn and none of these uh and protect against the global passive observer but the sensors known relations that we are where we find and he sensors known relations real around and that that's a good services to cooperate with each other you sold it at least that this somehow or there are realistic threatened and that that that and that there exists a global passive observer so then uh who will be you saw that each and has also poses some method to resist the internal local and active adversaries but due to some extent the and there are no what what what this special form of movement and free net but that they additionally provide host of rules plausible deniability in case and that they identified with his own compared to ITU P and taught in there if you operate hidden service the end you identified and then in yeah no no that's a small but you don't have plausible deniability so the then there will be we can also compare by the use cases really this season and that if you want to achieve this an anonymity and just the internet you can do this by Tong John the mean and partially also by i 2 p then services can be a proper all you have to you want to operate and service you can do this but with 2 i 2 p free unit the 10 fold at you have the option and that when you called infinite you can publish information and go offline and never show up in the network again and the information remains the different cases like of a few operate in services and tore I to keep the you have to stay online tools and those information which is also changing the tax office in this regard so uh and then anonymous time-sharing that's of possible with from I to p Freenet and and do you have uh and partially and talk about but that's the way it is known that they usually this like it's so but I thought from my impression I know what impression that that's quite a popular application were from I to treat at least and so on In a letter let's
compare provide a model to the and I will receive and and approval bottomlessness of finally the question who do you trust their photo you have uh of volunteers who operate related the before on the new you you have like that a a few new relay operators will which allows us some all approved by John mean but the yeah and tho for what I took 3 3 nodes Internet that you have and the fact that every P-A which is participating in the network is also provided to for the network so that in the in 2 other and properties so when we my compares usability size of the anonymity set window and active community in this regard so certainly talk it's considering the considerably better than than than than the other alternative so we investigated
so let's have a look at some research work there is so
long the 1 the world and that there some room for example are next project rare and that they investigate the options of you were from the anonymity uh which so you might be achieved by shuffling of Hyperion period the 6 addresses when this assumes that do you trust your eyes p the internet service provider and that that the the model provided some anonymity and yeah the men and there is also some of work going on and improving engineering a on the Argentina's at the moment and not not a really makes record so that they do know how do not uh shuffle and the messages of of for the latency reasons is so yeah that that the ideas is to have them there are even mimics Ned the
than that the free I application-specific if and only look at the messages from there is of was the last of as a researcher I and project in which tries to the to into idcos messages and they use a lot of noise of from for this to obscure the metadata and that there was a yeah and you see that that's the messages are sent to what's that drops and early that there are me 1 they're retrieved from by for example Bob 1 wants to send that and that this approach actually scaled so quite the reverse flow with an increase of the number of users so if you are interested in that
you might have a look at it and then before today so that was also talk about who picks the loop it's has been presented this year the soul that it's an at room poacher wherever they can use some cover traffic and and also makes based and there are at least and they aim to resist the powerful adversaries such as global passive observers and active attack us we have not done but I think that the the opinion that the it's good there and not an easy task to achieve so on and they have and the security goats officer now receiver unlinkability was and assignments and receive an unlinkable by third-party there's an hour and online observability is so so and that nobody can identify where whether those and this online or offline and receiver unobserved so
my conclusion this and that too good but then there certainly other options that will which you might want to explore then and there is no practical and is system out there which actually the global passive observer and the and I have we want to achieve anonymity and that this will not be possible without security the soul but I think it's worth very much appreciated if you go ahead and that's the system the report box and send patches through improve them and they all all my participation in this network so does only in and fulfill your own personal privacy but then you will increase the anonymity set and in this regard also improves the privacy of others so thank you and
it was thank you for this talk so we have a good amount of time this question so you can come to the microphones if you have 1 so and now I see someone a microphone forward so I can answer questions 1st report of the question for some regarding the new that and so on the free free stand um all as far as I understood it it's quite similar to like if s i in their respective so I'm giving some some months and the real data which can be retrieved through the network and as far as I have on society of S and that is achieved for the blockchain from our review of the achieved in with the caching part in there and the other 2 networks in
mn in OK we we we have been successful request will like in the request is so for what it and the file finally Ling number 9 of that enable us to assess and this request what's pop and Bob has this information and afterwards these information are stored there by the also so on the green line on the ring part the so that that that that that we note and degree node of our saving this information but that's that that answer your question no not really there is it is it on cash flow for eternity is cast with a block train algorithm on which test for a certain time and you said that the provider of the information can go off line and the information will still be there so the time the word and in the limit of the cash the like remember I amended their catches fold and then then the delete cells and their messages will which are the oldest like 0 I have not been requested for a long time so I can you please thinking around the room even more quite so everybody wants to focus instead that's and questions yes so that question answered Don would ask to signal angel if there's anything from the internet and yet there is and would you prefer I to be of a dollar for in-service it's latency was not a problem the hand and then that that is the difficulty a lot like the this year I like at the then the different security assumptions and that it's difficult to decide which system is more secure than than than the other so certainly that to what more actively developed and more actively researched and more actively tested and so on and that this of my might be something over which indicates that it's reasonable to decide to use talked talk about the and him and then maybe that it also depends on the specific services on them which should be operated from the not yet OK so stated above like someone so the go off the solutions you presented how well do these could do they scale or more specifically would it be feasible to run all Internet traffic on top of story and services right to p and looked that actually make the Internet a better place is this is the 1 that it was at the end and we we we can
have a look at that provide a model the moon I well I would say and this
that and talk requires volunteers to run the related to that pay for the traffic and this that does not scale as well as surface every P-A which is joining the network was also uh yeah relaying traffic but it depends on whether and to can grow as fast as to to the uh this is a scale that grows as 1 year I 2 different at all in many my we have microphone 3 I think over there and I was wondering when understand free Internet acts like some kind of distributed data store and so centers are a protected by the cash is there any way of having some kind of dynamic content in this kind networks you something which kind of makes his and dynamic contact is difficult and that then it is like a and a reasoner to will to what I tubule all for this and so this is like that you have study content and the other about but there and that there are some like a static websites sites like the free sites how they're called the infinite then maybe this can fulfill this purpose but not not real dynamic content OK I see what oil microphone 1 this and you think you mentions that all of networks are vulnerable to global passive observer can you explain to a more about this type of problem using this type of attack yeah the but
uh that allows a lot like a know actually read every if we cannot observe all links in the network so do this we observe all links in the network and then we know where exactly for all of them will which network sentences during what will which nodes and the perfect tool and the other end the year if we observe this over a long time but then there really can dramatic so the drastically reduce the anonymity set because of see that there maybe that and it's sending the message to that the 1st node and the 1st note that some of them may be sending some messages so 2 to 3 notes and the the next node notice also sending the message of 2 to 3 notes about the over a long period really we can pretty well correlated perfect but is of practical now for if we but then radical well of although it has a problem of adaptive and I I don't know about that can capabilities about but the light like evolve for John Newman uh where you have like very few relates back yeah let's say that they have 20 relates or something like this and that this is even if they are on different jurists again can and jurisdictions and it's actually a good able for for secret service to observe of exactly the traffic of 20 relays so now and it's certainly a more difficult if you have 70 notes that 70 thousand nodes about but and the moon for for some metrics since reasoning annotators signal Eigil again please and roughly wants to know whether you have looked into the rifle and community network by cannot at IT which is currently still in the research project as far as you you get a question because I can hear but anyway they can place yes and solid roughly wants to know whether you have looked into the right to land on them into a non name and on the network by knocking and I need to get out of it really looked into it and the new right so that's a different approach so where where that that the user that the DC notes non-binding cryptography that you know cryptographer and that's the end of this the other that down and actually and because they use a multiparty computation and there they can resist an attack on if only 1 member of the of the there the of the of only 1 relay is think that that then then they can provide and the anonymity so then that this also certainly interesting and that they also have another approach which is called verified shuffle robot you also can prove that that shuffled really what is that it makes shuffle the order of the messages OK then we have microphone someone I've things for for the torque and this part of the research did you would look at that and the resiliency to produce from the resiliency through censorship and indeed in many places many enterprises using these tools is considered the a security risk and so wanted to give you a and an attention to that is part of the service which 1 of them is the more resilient no the with and this year at all OK so be we can have a look at that that like a peer-to-peer networks of women and that I I would say that they're very resilient and in in me because their soul of many different high pieces were which show you on them and different peers which you connect that it's difficult for the center to loose sense all those addresses and the kind of fall for this and so it might even be difficult to will receive the information which peers are actually involved in this peer-to-peer network so that there's no not a list of all appears connecting our were which are and what the kind of form and toward the and that there this information of are often the reason I say about that this also and there's so and there also on are like the list of relates to the public but there are also some secret a the some signal that they they call bridges and where where you can as she's the the access to look to the network so that there's also and then foot on the name of we we looked at it like it there another user as proxying that information to achieve some the worship of resistance yeah and banks in so microphone for planes but did you look at the encryption algorithm of all this network views and what's your analysis all of the reagent in law looked at all and that is so them about that theory we looked like some use on in encryption on style encryption others that only encrypt from mob too hot so you have about but within the looked into a specific the specific encryption surface was something like that the and I see the Internet has another question and yes that well it's interesting in interested in what you think about research in the beautiful onion routing of what party in terms of accessibility and possible spread the finds it quite interesting I think that little clarification of a k can you please repeat the question that the years and it's uh about the research in the field of onion routing over what parts to the and because of the question you asked a things that this field is in terms of x and the accessibility and possible spread quite an interesting approach and I actually I didn't looked into it but I am standard like above about seasonal so and that that it's done within the browser will never the exterior no I I can I cannot answer the questions and so a 10 microphone 3 hello you my questions about just that they're all like dated here can you cannot defend themselves against a global as a provider but in order to scale the probability that you can be found with the number of with the number of the contaminated notes like which of those for which of those for the so what is the max number of nodes that can be contaminated with you probably been like with you being 50 % secure something along the lines of the entire book and we in if it has the OK let let let's try that with them and
you will OK uh
usually if you have this is set up and that that the entry node and exit to like if you know and that there are a tree notes within the router lower in the past and the you know the data entry nodes and exit nodes which are you are using are malicious and they're cooperating with each other and then it's a very very difficult to to to have power and traffic but Don which so that that's not the identify you and the this so what would be the lot like or names valid for all for all the involved for in and torn and and John so our and the for for the peer-to-peer networks at the bottom pants on in bus that less like a flight a p has 7 the solvent notes but but the your your neighbors so I'm not malicious the so the data is to protect you and I and II toupeed and their no assistance and the length of the tunnel is also not the new fixed there were the non not specifically known and and each in each peak and then decide how long his country should be the and we know that it's all it's quite difficult for out to know whether that that this attack as the entry point and the sites and that's the moving really entity like and besides and uh this is a list of of foreign entry got volume for entry node yeah and it's it's more of the dangerous because he knows that that that this item is like the a real person OK the last person I think is a microphone 1 so you talked about plausible deniability of we that uh and it's a Freeman of can can you say what you can deny it and what not for example and you say that I part of the network of some the
a liquor usually you you can deny and and that the mean and meant that in uh the last book in this case because and and that a cat that doesn't know whether you are the last hop and whether you really it receive this information or whether there there's an out half the what's the so that if you send this information to somebody then he can deny no I only propagated the world transmitted this information to some of the notes and this is quite cross of the soul and if you the you have the information and then actually the the amount of time and and that the green note desolate nowhere better and this information was posted uh by the red node the blue note the so judge us most OK and that this information was somewhere of abandoned that and the smell coming to me then another thing with which I did mention that you store of information as uh as a pure and the the information is stored in its encrypted and there you actually do not know what what what is inside this fired so you would you storing information but you can't deny that that you will know that this is this a specific information so this is also something which you propose the non OK I didn't see any more questions have another 1 or you have other questions the use of normal just networks of provided of the protection against in the field past of so of all right you have of if you have folders but like I 2 people to we're a small connection up to you know an attack against because face can provide I to of protection the public against such attacks OK I to be boarded at this layer like this e-mail the application the uh of of finding its way and in my my might be easier to to provide this will be because the Amazon sometimes see Willie sentencing message and then uh it can be possible but if like like you have service and I to be and the USA and you you are able to request some information from it and and this this is sending the information and have that then you can go correlated this information but causing a message it's sometimes more difficult OK I think we have answered all the questions I don't see any more and that also fits all the time so thank you again for a torch what want to do it in
thank you thank you thank you thank you to the
it the week after people
act as
Telekommunikation
Proxy Server
Datenmissbrauch
Subtraktion
Sondierung
Computersicherheit
Formale Sprache
Stellenring
Gruppenkeim
Information
Twitter <Softwareplattform>
Konfiguration <Informatik>
Software Radio
Dijkstra-Algorithmus
Physikalisches System
Scheduling
Knotenmenge
Flächeninhalt
Mobiles Internet
Neuronales Netz
Telekommunikation
Gewicht <Mathematik>
Menge
Webforum
Gruppenkeim
Strategisches Spiel
Strömungsrichtung
Neuronales Netz
Frequenz
Identifizierbarkeit
Aggregatzustand
Neuronales Netz
Telekommunikation
Menge
Telekommunikation
Vektorpotenzial
p-Block
Neuronales Netz
Schlüsselverwaltung
Konfiguration <Informatik>
Neuronales Netz
Objekt <Kategorie>
Physikalisches System
Perspektive
Kategorie <Mathematik>
Telekommunikation
Neuronales Netz
Message-Passing
Standardabweichung
Subtraktion
Multiplikation
Gewicht <Mathematik>
Prozess <Physik>
Analysis
Systemprogrammierung
Message-Passing
Informationsmodellierung
Perspektive
Proxy Server
Gruppe <Mathematik>
Mustersprache
Notepad-Computer
Inhalt <Mathematik>
Broadcastingverfahren
Kurvenanpassung
Neuronales Netz
Analysis
Computersicherheit
Nummerung
Telekommunikation
Überlagerung <Mathematik>
Physikalisches System
Quick-Sort
Rechenschieber
Mustersprache
Soft Computing
Chiffrierung
Strategisches Spiel
Wort <Informatik>
Message-Passing
Assoziativgesetz
Schwellwertverfahren
Einfache Genauigkeit
Telekommunikation
Mailing-Liste
Schlussregel
Nummerung
Term
Rechenschieber
Chiffrierung
Knotenmenge
Chiffrierung
Minimalgrad
Kontrollstruktur
Routing
Ordnung <Mathematik>
Neuronales Netz
Message-Passing
Bit
Quader
Selbst organisierendes System
t-Test
Richtung
Chiffrierung
Message-Passing
Multiplikation
Knotenmenge
Nichtunterscheidbarkeit
Gerade
Peer-to-Peer-Netz
Ontologie <Wissensverarbeitung>
Schlussregel
Peer-to-Peer-Netz
Mailing-Liste
Paarvergleich
Bitrate
Binder <Informatik>
Rechenschieber
Chiffrierung
Festspeicher
Mereologie
Routing
Computerarchitektur
Message-Passing
Neuronales Netz
Standardabweichung
Adressraum
Klasse <Mathematik>
Mereologie
Zellularer Automat
Marketinginformationssystem
Neuronales Netz
Informatik
Schlüsselverwaltung
Message-Passing
Neuronales Netz
Internetworking
Proxy Server
Web Site
Morphismus
Gewichtete Summe
Kartesische Koordinaten
Dienst <Informatik>
E-Mail
Bildschirmmaske
Knotenmenge
Trennschärfe <Statistik>
Softwareentwickler
Neuronales Netz
Peer-to-Peer-Netz
Funktion <Mathematik>
Leistung <Physik>
Autorisierung
Speicher <Informatik>
Peer-to-Peer-Netz
Paarvergleich
Kontextbezogenes System
Knotenmenge
Fokalpunkt
Dienst <Informatik>
Loop
Mereologie
Projektive Ebene
Normalvektor
Ordnung <Mathematik>
Neuronales Netz
Router
Telekommunikation
Stellenring
Quader
Extrempunkt
Bootstrap-Aggregation
Internetworking
Quellcode
Chiffrierung
Last
Message-Passing
Knotenmenge
Software
Adressraum
Explorative Datenanalyse
Private-key-Kryptosystem
NP-hartes Problem
Konstruktor <Informatik>
Schlüsselverwaltung
Booten
Mailing-Liste
Peer-to-Peer-Netz
Schwach besetzte Matrix
Quellcode
Binder <Informatik>
Symmetrische Matrix
Chiffrierung
Verbandstheorie
Last
Mereologie
Windkanal
Wort <Informatik>
Neuronales Netz
Standardabweichung
Public-Key-Kryptosystem
Hash-Algorithmus
Mengentheoretische Topologie
Kartesische Koordinaten
Dienst <Informatik>
E-Mail
Web-Seite
Information
Homepage
Netzwerktopologie
Freeware
Netzwerkdatenbanksystem
Hash-Algorithmus
Punkt
Datenstruktur
Speicher <Informatik>
Neuronales Netz
Peer-to-Peer-Netz
Vererbungshierarchie
Speicher <Informatik>
Peer-to-Peer-Netz
Mailing-Liste
Knotenmenge
Frequenz
Konfiguration <Informatik>
Dienst <Informatik>
Menge
Datenstruktur
Chatten <Kommunikation>
Identifizierbarkeit
Information
Aggregatzustand
Tabelle <Informatik>
Subtraktion
Gewicht <Mathematik>
Application sharing
Mengentheoretische Topologie
Zahlenbereich
Kartesische Koordinaten
Netzwerktopologie
Message-Passing
Knotenmenge
Informationsmodellierung
Mustersprache
Speicher <Informatik>
Neuronales Netz
Green-Funktion
Datenmodell
Peer-to-Peer-Netz
Binder <Informatik>
Knotenmenge
Konfiguration <Informatik>
Keller <Informatik>
Arithmetisches Mittel
Chiffrierung
Verbandstheorie
Mereologie
Information
Schlüsselverwaltung
Message-Passing
Neuronales Netz
Internetworking
Maschinenschreiben
Nichtlinearer Operator
Linienelement
Pay-TV
Adressraum
Applet
Mailing-Liste
Nichtlinearer Operator
Binder <Informatik>
Knotenmenge
Service provider
Dienst <Informatik>
Knotenmenge
Informationsmodellierung
Proxy Server
Adressraum
Pay-TV
Bandmatrix
Projektive Ebene
Boolesche Algebra
Ordnung <Mathematik>
Programmierumgebung
Message-Passing
EINKAUF <Programm>
Firewall
Klasse <Mathematik>
Summengleichung
Kartesische Koordinaten
Wärmeübergang
Dienst <Informatik>
E-Mail
Information
Bildschirmmaske
Einheit <Mathematik>
Authentifikation
Wärmeübergang
Mixed Reality
Zeitrichtung
Router
Urbild <Mathematik>
Neuronales Netz
Einfach zusammenhängender Raum
Internetworking
Architektur <Informatik>
Ereignishorizont
Konfiguration <Informatik>
Dienst <Informatik>
Minimalgrad
Gamecontroller
Bandmatrix
Information
Systemidentifikation
Stellenring
Gewicht <Mathematik>
Freeware
EINKAUF <Programm>
Luenberger-Beobachter
Summengleichung
Kartesische Koordinaten
Dienst <Informatik>
E-Mail
Internetworking
Systemprogrammierung
Bildschirmmaske
Einheit <Mathematik>
Authentifikation
Wärmeübergang
Luenberger-Beobachter
Maßerweiterung
Internetworking
Elektronische Publikation
Relativitätstheorie
Datenmodell
Paarvergleich
Schlussregel
Physikalisches System
Unendlichkeit
Office-Paket
Arithmetisches Mittel
Dienst <Informatik>
Information
Neuronales Netz
Nichtlinearer Operator
Kategorie <Mathematik>
Benutzerfreundlichkeit
Datenmodell
Paarvergleich
Benutzerfreundlichkeit
Nichtlinearer Operator
PA-RISC 2.0
Internetworking
Systemprogrammierung
Service provider
Informationsmodellierung
Knotenmenge
Loop
Digitale Photographie
Bildschirmfenster
Kategorie <Mathematik>
Äußere Algebra eines Moduls
Neuronales Netz
Tropfen
Metadaten
Momentenproblem
Adressraum
Datenmodell
Zahlenbereich
Geräusch
Frequenz
Datenfluss
Datenmissbrauch
Service provider
Konfiguration <Informatik>
Service provider
Geräusch
Message-Passing
Informationsmodellierung
Maßstab
Reverse Engineering
Adressraum
Projektive Ebene
Message-Passing
Explosion <Stochastik>
Datenmissbrauch
Quader
Computersicherheit
Luenberger-Beobachter
Telekommunikation
Patch <Software>
Physikalisches System
Datenmissbrauch
Konfiguration <Informatik>
Office-Paket
Überlagerung <Mathematik>
Task
Systemprogrammierung
Physikalisches System
Loop
Patch <Software>
Message-Passing
Softwaretest
Menge
Loop
Computersicherheit
Luenberger-Beobachter
Neuronales Netz
Verkehrsinformation
Neuronales Netz
Leistung <Physik>
Inklusion <Mathematik>
Internetworking
Architektur <Informatik>
EINKAUF <Programm>
Freeware
Sondierung
Güte der Anpassung
Datenmodell
Summengleichung
Dienst <Informatik>
Information
E-Mail
Datenmissbrauch
Service provider
Authentifikation
Adressraum
Wärmeübergang
Mereologie
Neuronales Netz
Verkehrsinformation
Subtraktion
Wellenpaket
Zellularer Automat
Zahlenbereich
Dienst <Informatik>
Information
Nichtlinearer Operator
Service provider
Internetworking
Knotenmenge
Informationsmodellierung
Unterring
Algorithmus
Proxy Server
Pay-TV
Inverser Limes
Neuronales Netz
Gerade
Softwaretest
Internetworking
Architektur <Informatik>
Computersicherheit
Applet
Physikalisches System
p-Block
Elektronische Publikation
Datenfluss
Dienst <Informatik>
Minimalgrad
Mereologie
Information
Message-Passing
Beobachtungsstudie
Zentrische Streckung
Web Site
Freeware
Diskretes System
Datenmodell
Paarvergleich
Benutzerfreundlichkeit
Nichtlinearer Operator
PA-RISC 2.0
Datenmissbrauch
Unendlichkeit
Internetworking
Hydrostatik
Systemprogrammierung
Service provider
Flächentheorie
Adressraum
Datentyp
Kategorie <Mathematik>
Luenberger-Beobachter
Inhalt <Mathematik>
Speicher <Informatik>
Neuronales Netz
Mengentheoretische Topologie
Extrempunkt
Browser
Adressraum
Summengleichung
Bridge <Kommunikationstechnik>
Benutzerfreundlichkeit
Information
Gesetz <Physik>
Service provider
Internetworking
Kryptologie
Wärmeübergang
Neuronales Netz
Gerade
Umwandlungsenthalpie
Internetworking
Drall <Mathematik>
Sichtenkonzept
Computersicherheit
Speicher <Informatik>
Applet
Marketinginformationssystem
Knotenmenge
Frequenz
Dienst <Informatik>
Soft Computing
Chiffrierung
Datenfeld
Menge
Rechter Winkel
Anpassung <Mathematik>
Kategorie <Mathematik>
Projektive Ebene
Information
Ordnung <Mathematik>
Message-Passing
Ebene
Subtraktion
EINKAUF <Programm>
Zahlenbereich
E-Mail
Nichtlinearer Operator
Term
Physikalische Theorie
Homepage
Service provider
Systemprogrammierung
Knotenmenge
Bildschirmmaske
Authentifikation
Flächentheorie
Proxy Server
Pay-TV
Peer-to-Peer-Netz
Analysis
Linienelement
sinc-Funktion
Datenmodell
Paarvergleich
Peer-to-Peer-Netz
Mailing-Liste
Binder <Informatik>
Roboter
Moment <Stochastik>
Chatten <Kommunikation>
Mereologie
Unternehmensarchitektur
Neuronales Netz
Dicke
Web Site
Punkt
Validität
Telekommunikation
Peer-to-Peer-Netz
Mailing-Liste
Netzwerktopologie
Knotenmenge
System F
Mereologie
Minimum
Bus <Informatik>
Notepad-Computer
Router
Spezifisches Volumen
Neuronales Netz
Leistung <Physik>
Neuronales Netz
Einfach zusammenhängender Raum
Kartesische Koordinaten
Marketinginformationssystem
Arithmetisches Mittel
Knotenmenge
Dienst <Informatik>
Datenfeld
Information
Computerunterstützte Übersetzung
E-Mail
Neuronales Netz
Message-Passing
Neuronales Netz
Medianwert
Systemprogrammierung
Neue Medien

Metadaten

Formale Metadaten

Titel How Alice and Bob meet if they don't like onions
Untertitel Survey of Network Anonymisation Techniques
Serientitel 34th Chaos Communication Congress
Autor Mueller, Tobias
Erik
Matthias
Lizenz CC-Namensnennung 4.0 International:
Sie dürfen das Werk bzw. den Inhalt zu jedem legalen Zweck nutzen, verändern und in unveränderter oder veränderter Form vervielfältigen, verbreiten und öffentlich zugänglich machen, sofern Sie den Namen des Autors/Rechteinhabers in der von ihm festgelegten Weise nennen.
DOI 10.5446/34866
Herausgeber Chaos Computer Club e.V.
Erscheinungsjahr 2017
Sprache Englisch

Inhaltliche Metadaten

Fachgebiet Informatik
Abstract There exists no such thing as a perfect anonymity network with low latency, low bandwith consumption which provides strong anonymity. Popular anonymisation networks rightfully focus on Web browsing, because that is the most popular application on todays Internet. The most popular anonymisation network is, rightfully so, Tor. You might, however, not have the requirements that mandate the use of the Tor network and thus are looking for alternatives. In this talk, we present alternatives to the popular Tor anonymisation network and examine what they achieve and how they differ.
Schlagwörter Resilience

Zugehöriges Material

Video wird in der folgenden Ressource zitiert

Ähnliche Filme

Loading...
Feedback