Bestand wählen
Merken

Modern key distribution with ClaimChain

Zitierlink des Filmsegments
Embed Code

Automatisierte Medienanalyse

Beta
Erkannte Entitäten
Sprachtranskript
it was and
and the the I guess many of you are using PGP here if you do not raise your hand it good hackers so if if you want an introduction to someone new that you know someone else has a key to you usually have to do a little dance ask for PDF key to that and that person because that's well let submitted public of key services boring but that's the way you should in have what if I told you there is a better way what any of your friends and friends of friends can attest that a certain key actually belongs to someone in a more nicer way than just attaching signatures to PGP keys or that speakers will introduce you to clean chains system aiming to solve this problem this dual role of applause to that for a researcher from the few the few high uh so here it is even a greater description of what we will be talking about it's called clean things it's a modern key distribution mechanism but according to plementation uh that we've done in collaboration with the ball quantities and that on cause of from offense and of than it is from University College London I'm I think it's again From universe College London so in a few words claimed saying the the decentralized public key infrastructure that supports privacy-friendly so solidification and if you read the the description of our dog you know that we would be mentioning a lot toward blocked
a in yeah so is the type of course built-in could be used in many applications but actually they provide some very good uh properties that might be useful for public key infrastructures for example uh they provide high dignity for the data that we store the and but they have become tamper proof it's very difficult to modify them without a attains the overriding the history and we can also be sort of the of disk of the data because of all these cryptographic signing a in going on yeah end by definition looked inside are decentralized so they can provide good availability uh you can get you can go to where needed calling for node for example and verify your transactions they're they're very they're sensors visits and if you want to be dying to being uh bit going down you have to go and being every 4 node uh down and they solve the problem of the global concessions to the a look at a mechanism offered proof of war the more so so you disappeared you the systems uh then there the more uh biology get in the looking more tickets get the OK to so
the 1st the of built-in based public-interest answers are based on stats proof of work and block chains for example name-calling and blocks that a very have replaced the kind of uh I use that going talk it that they could because tokens for identities therefore you can buy identities you can say you can sell them to others it said and they belong to you so uh this is a more powerful abstraction afraid of it is compared to PDB keys and we use in today and they also provide you with global namespace if you have this identity in name calling it is you uh everybody uh will recognize you as the owner of that identity on the other side the provide no mechanism for social validation if somebody claims to be for example uh I listen that system how can we know how the for the people who claim to be i that this person is actually uh the notable stuff mechanisms or does are public and this has some uh privacy implications for example you might be able look at those actions to in fear that some identities are link linked to each other there are some in here and see that users have to pay uh them for buying coins and foreign transaction fees and of course it's very resource expressed with a proof for that is a centimeter latency uh for every block to be that a specific number of transactions that can be included a new yeah and so on then came the Nixon there is a public key
for sensors and look things there with the Bayes and that the X that did that can be deployed there by e-mail providers for lies the main so what they did they replace that Iran's actions broke with America but if extreme I wouldn't describing a bit disease and when they had seen these accentability uh um for the providers with regards to the keys they published about the user's so imagine for example of the major using you could go entities and the public key material forwards e-mail user from the ergodic 7 your get some proof this is the same key that everybody's getting at that specific time so you have discovery because you know for example that I listed the maybe looks to the demon provided you go there there and is very efficient because it's only gulag maintains and constructs the structures and they can provide you with very efficient uh proof in a few kilobytes that actually this is that I did that you get on the other side they do not prevent the duplication they just make a detectable at a later stage which might be a little too late and then to an extent very odd centralizing the public key infrastructure which opens them to attacks for exam because the ising depend upon the failure if seem a conic accessories down then you won't be able to get the PDB a key material for their the many users and also boats uh the providers in this business to perform surveillance with regard to who is getting a there will was I going indicates the reading the social graph of the users would like to do what did the so the men by by that I mentioned
before is that this is a method by the as you see but the difference is that in order to sort the leaf nodes when we're inserting them we're using a verified the random function is that of a class we use this very that of a function but it is a function that produces a unique output given the private key so imagine that I have a private key by for that is compatible with this refinement function I can produce an article that looks at random to everybody you can guess it but if I give you the public key you can verify that this is the unique output in these as it is of when applied to medical a priest there are services that everybody who sense a full valence a specific label will end up to the same a leaf node in the middle of the therefore bird and therefore at sitting on equivocation I cannot if you if 2 people come to Koenig's the may provide the dust for either to the main uh because of these properties they were both get the same leaf node now claim since
how are we using the limited by the repressive seasons house with the within different compared to the Dayton Accord for example but we do
different these we push borders and alization by giving the users cost a and the claim saying by themselves so which have a claim saying for each user or for each of the devices or voice of their identity that they want don't want to connect for example of alice with his filtering book unseen and guy folks would be a new 1 and even that even use here is a different thing there is no consensus on the global consensus broke celebrated as needed you just then that at the center signed with assigning key about state everybody can verify that these a sequence this sequence is valid the aim of the now that at some point these a fork because to valid blokes bodies in it from a and a given block then then this can be interpreted as a compromise because somebody his his good my signing key and publish something different or it could be that I've tried to people cate to 1 of the leaders and finally we've also added there and a fine-grained access control mechanisms based on capabilities a that allows a lot the glimpsing owners to select a cork in the specific claim and 4 and that for the knowledge evocation of the limited prefix-trees we're so that all the does get the same content yet so we need a way to propagate this information because yeah how do we know that of updates of our friends how do we find out that there the big how does the key distribution works the we've interweaving this search mechanism of course costing where we include you involves a stunt over the latest state of the the bill of the claim seems all of our friends so you see here for example that I list includes a and at this meant for bobsleigh this broke and died folks latest block and the bold always include a statement but it is a but it at the previous point that yeah he was aware of it it might be bit but that's how um consensus and the propagation watching these systems so we whichever additional of of key
updates in cliques of users in groups of user this is how a gossiping works and the award and between the humans anyway we don't vouch 4 we don't just happen people graphic signs on keys of other users a but we a also all valid for the latest state of theory view of the world and we can use this course passing mechanism for introducing friends for social validation of a web of test while at the same time preserving their source the bias of the social graph of the Clinton owners
an overview of the clean same properties so clean things are kind thinking the uh also indicated that the source kind dignity because of their built things and the MegaGraphics 3 authenticated because of all the signing going on that can support the net claims so we've decided to use this for the public key infrastructure you can use the claims structure for building a axis condo delegation or command and control for your botnets natural whatever you might come up with uh at the same time we are suppressed by the scene of the claim that their bodies even though this even though everything cause public you would do not reveal any information about the content uh offer them of the claims or we of all about readers of the claims and we do that there be a capability mechanism uh but well and that in a bit but was sometimes community would you select would presented that would include different things to different readers with pre we again prevent that auditors gets uh the same views there because housing mechanism enables the propagation vaulting all the latest state of linked planes saints I've mentioned addictive addition attempts and compromises produced none of it applicable graphic evidence the Clinton forks in the in the bucket of graphic evidence and means that we can take them their self-sustained all evidence that we can say with the work that we've observed 2 blokes originating from a specific broken died for their for something Zone without limiting now we got to deployment and we spend a lot of time with a lot of work in evaluating call uh Clinton can scale and how effective it is with regards to keep obligation etc. and how what about with requirements uh what to do with B does it take to compute the that's it said that uh you can find all this information the clean things that you have that I Bates we which give our paper they claim since is very flexible there's deployment can work in the Federated scenarios like encoding so it can work a with high availability aligned at the stores when we just go on and the build of all of our blogs or it can even work in that gossiping cannot scenario when we just obtained and the do you want to for the same source it's only when you just include the proofs in the e-mail that you want then you would get that's here we had that system the area you want in the mail send with your friends with the and we can do it that they wouldn't do that in a very efficient way by including all of the claims that we want to include for that to be there class some evidence that these claims are actually part of of the of the claim saying and all that that that proof of inclusion and in the middle said that now than
Dennis of and we see him some time for that the uh um the blocks that his sampling same political information like the vision of course a timestamp uh the block sequence index some nodes that we use for achieving applicability between uh many of the claims in the capabilities because different blocks Clinton metadata or the connected identities may be article insane or it we don't handle in made that the user wants to connect into this contain and some public key that there needed for the operation of Clinton uh we need the public key for signing new blogs the public key for the revival of the funds that we use for them at a prefix tree and the diffusion monkey that we use for the capabilities picnic the then then the main the core element of fall the block is the block map is that the way we store or the claims in the capabilities in the form of a make exchange of course pointers to previous books that's how we saved how we uh and connect the blokes until the now we will see that all of them a fields on the left of the payload of the block we sigh needs and we about the signature this is a self-sustained a piece of information we get at that's to defend therefore right to an e-mail or we can be stored in the online there so that we do not trust and speed and the B so that no 1 can tumble information it we want
add they claim for example we are analysis uh amendment to the 60 and we want to add the acclaim of a girl a ghost house for bold face it would to define a the label but we will be using for Bob From now on it's gonna be bolded as but net and let's imagine that the claim is the latest kids so 1st we're going
to compute the claim With away from another function using alysis private key and then we we're gonna put inside the ballpark it dies of that blast the norms so that we get the 1 because of missing for the then we can calculate the index of the leaf nodes a however the so that a leaf node in the tree simply a by taking the claim key and consonant with the stink look up and whether the narrator semantic addition key again by taking the call that there they claimed he came from step 1 end up a bending the up and condition of then costing it altogether so we entered that claim content with the Semantic addition key that we got in step number 3 and we also include a the VRF proof that that the that that people can go and get to be sure that the that we verify that we've computed in step number 1 is actually the collect and the only 1 so that's how we get there leaf node a that corresponds to the gross costs for player for books start we start looking at the neck
scenario we want to add a capability for Guy Fawkes to read bulbs uh because cast artists uh analysis circling insane the 1st step
we use it if he him to establish the to assess circuit s between the Alison guy folks so we use that said secret into class again along with norms and with look to generate the the capability lookup keen that's that's that would be the index all of their look up key of their capability to claim that will allow us to it in that the notice is here you know that but semantic abilities and to the abundance of cloud capabilities are added and then revoked a way that it I was emitting key as we did before and we got way Bernanke the claim he uh um from the blue leaf nodes that we've added before without any without the Semitic Akkadian cue from step 3 the so that the guy folks can be given in the future so we generated a leaf node and we started
committee now if guy Fox wants to retrieve a that a kid that I wants to find out the latest update for ball analysis the kid gonna do the reverse process he's good established a diffusion must have said circuit as between us and guide folks and gets the tip of the needle that key the Semitic key in the same way that alice computed it's and he's gonna go to the alysis claimed 3 method that fits the editing of the corresponding leaf note he's 1 of the connected with uh the symmetric key k from step a number 3 the and you will be able to get there the claim the 4 books claims so far then if you if you remember their claim key for books inclusive out of the house of various so he's gonna it to be and books claim from Ilisei cermet but if extreme and agreed it an it the using the yet again thinking compute the out of the because a of before yeah uh and I would download you he needs tool use Viviane proved that is embedded into the because could claim uh in order to verify that actually the vat of prove that he gets is the only 1 that I this ship produced with yeah via if private key because I the yeah we
went through that very fast there but again the all this information is in the paper and and you can take a look at it so please and come find me afterward that I have more slide that explain how proof of inclusion locale proof of options work etc. yeah our fingers emission these 11 step number 4 if Guy Fawkes air ties to retrieve a capability broke and cannot find the 2 it means that the I lose she's not given to guide folks a capability to read a and the claim about bold all a weak and at that point Guy Fawkes cannot know whether a capability for broke for for bold exist at all now we submitted to the this talk
for this is against that uh and we understand that is academic work extends but we do care about the resilience and would like to share some profile yes the what what sport why we decide to do that 1st of all we started with a 50 cents to understand user needs a this was on their by somebody sentencing in bodies a later on we call we bit brother that get about is the INS need to be open to collaborations with the communities that they already working on these problems and we've done that for example we some uh out with another organization in their money and we're close collaboration we felt could that there and we've used techniques for all that there actually again very very a urban value we will use to their I OK so so in academia the reason this techniques going on now there in applied the suits that God is pushing for it formally find the properties and the call that you're producing and for cleansing specific we had before we have formally defined a defined or the security and privacy properties using cryptographic games so we know for example that would provide a monarchy vocational under what terms and that we can provide applicability echoes blokes again because of this and this and this could about getting that we can combine together and we also share of a formerly forgive formerly formally verified documentation fall follow cryptographic components saying of stock and so you can go and find them at a prefix tree and then we add a 3rd function a node if a propose a torus um when it comes to museums we need to know of how our systems can ski and therefore we use simulations and with real world data from the and another set this is a a leak the name is directly drove them a company called on so it's usually use the academia fall for a when we need to simulate the world the communication patterns and we've used this for calculating the efficiency of probe of a because passing protocol in propagating the latest state uh off other people's key material a when it comes to know better beacon plans for gradual deployment as we've mentioned claimed things uh 1 is very flexible on how you were deployed we've chosen to be the when we know for example whether that must yet but we know that if and when it comes to a the actually giving static agreement to give this to users the we need to be compatible with all existing good e-mail encryption applications so for example you we want to be compatible with computes the agent again something that is very important the little thing we've done great work here but the usability of a e-mail encryption how do you how do you all but for key management in a way that users can understand no them mistakes what happens when there a we need you need to to revoke a key or there's a key compromise how do you communicate is rule the user and how alone the follow a and we can act upon that uh and yeah this is this is a database that is going on on that anniversary would would we we don't we consider we solve this at all we focused on the a coming up with the status of the properties and the uh this simulating call clean things can scale and work effectively uh hopefully the we've had a we've been able to do all of the above all because we have a multidisciplinary team inex leap and we've got sociology's we've got philosophers a cryptographer there's and it's good to have European projects that are focused on privacy and secure communications and um they can actually use their knowledge so fair or parties for that that and that I think we also do this is also forces pushing for open innovation all of flower uh materially boards and source code is open to the public and that everybody can go and take the glinting structure and use it for other therefore other types of applications so this is how we yeah we we can extend the clean things now so we the 2 of the 4 questions that usually we must
real-time few canadian we have 4 microphones here in the hall slope extremely thank you again very much money which we do have a question from the Internet's sequential it's just as far as I understand to use this system you both have to do this assignment dense just and GPT but also to ask your friends to give you read access to parts of the social graph isn't that even harder to use and scale them GPG your understanding is correct we still need to all those these crazy dancing uh and ceremonies and key signing parties if you will a and if you want to be sure about that the other person who was that you have that i'd Clinton for the other person the moon but we believe that the movies mechanism off the introductions it might be it might actually now let's see how it works
and so this is part of the simulations and as you can see on that I on the left a we simulate the complete is a delay scenario where we would just their thoughts introductions in a maze and we see that the it kind of works a without having to a view that the person was introducing you to the other a participant of the conversation that you can when we say that we can have a a good status over e-mail amazed going go out and connected with the light keys microphone number 1 piece I'm interested in the expressiveness of the your and Cape Verde based access model I'm dudes for things like groups genes or revocation of credentials and the use of costs of dedicating rights access is like up you can do all that this is a very young Fayum you can do what we do for example we say that you can use a 6 by the semantics and then you can do whatever you like like that is called the obligations and all you can be placed on top of Our step but we've we have a the microphone number to please yeah use 256 for both Wilcock encryption key generation how difficult would be the change of forward spoken 1 base a given that
we can a claim saying political events from somewhere at the top of the
block structure that's how we that's how you would probably tainted by the knowledge would be easy to thank you microphone replaced the higher thank you great talk and I want to ask about the creativity and and can duration process around the wire using a food chain uh hash function to derive cues smoked some key derivation function like age canadian or could be canadian
there yeah I think it's for simplicity reasons but yeah and the human and so that the what he was suggesting is better and the would you like discuss about it the 1st thing we have time for 1 more clicker question from the internet before we have to close that's how is privacy of the social graph of the cross hatching short again I'm not sure I fully understand them the their of the social graph and how how do we protect that of the privacy of the of the social graph it was the cross hashing how was this should a OK so if you take a look at their when we add the claim the actual content of the claim of but we put in our uh make the sixties is encouraged its the it it does not leak any information about the label or the content of that claim show and because of the capability mechanism of allowing corner specific number of readers to a specific goes class I think that's how we perceive the purpose of the social graph yeah thank you to everyone essentially we ran out of time but the lottery ocean be here for a little while longer so you can catch up with him over a trunk for years added well thank you for your few b to to that
it is it and and the and the the court compose the week at put cow
Sichtbarkeitsverfahren
Distributionstheorie
Kraftfahrzeugmechatroniker
Distributionstheorie
Public-Key-Infrastruktur
Physikalischer Effekt
Programmverifikation
Dichte <Stochastik>
Physikalisches System
Elektronische Unterschrift
Datenmissbrauch
Digitale Photographie
Dijkstra-Algorithmus
Deskriptive Statistik
Dienst <Informatik>
Kollaboration <Informatik>
Task
Verkettung <Informatik>
Dualitätstheorie
Wort <Informatik>
Hacker
Grundraum
Schlüsselverwaltung
Kette <Mathematik>
Public-Key-Kryptosystem
Hash-Algorithmus
Public-Key-Infrastruktur
Gruppenoperation
Zahlenbereich
Kartesische Koordinaten
Identitätsverwaltung
E-Mail
Abstraktionsebene
Zeitstempel
Knotenmenge
Konsistenz <Informatik>
Vorzeichen <Mathematik>
Mini-Disc
Datentyp
Nichtunterscheidbarkeit
Transaktionsverwaltung
Kette <Mathematik>
Umwandlungsenthalpie
Kraftfahrzeugmechatroniker
Datenmissbrauch
Namensraum
Kategorie <Mathematik>
Namensraum
Validität
Statistische Analyse
Physikalisches System
p-Block
Zeiger <Informatik>
Binder <Informatik>
Mechanismus-Design-Theorie
Quick-Sort
Keller <Informatik>
Transaktionsverwaltung
Verkettung <Informatik>
Beweistheorie
p-Block
Schlüsselverwaltung
Beweistheorie
Public-Key-Kryptosystem
Bit
Subtraktion
Public-Key-Infrastruktur
Gruppenoperation
Klasse <Mathematik>
Programmverifikation
Service provider
Knotenmenge
Zufallszahlen
Datenstruktur
Maßerweiterung
Funktion <Mathematik>
Kette <Mathematik>
Binärcode
Lineares Funktional
Lipschitz-Bedingung
Graph
Kategorie <Mathematik>
Netzwerktopologie
Dienst <Informatik>
Funktion <Mathematik>
Wurzel <Mathematik>
Beweistheorie
Dämon <Informatik>
Ordnung <Mathematik>
Ising-Modell
Schlüsselverwaltung
Distributionstheorie
Kraftfahrzeugmechatroniker
Folge <Mathematik>
Befehl <Informatik>
Subtraktion
Hash-Algorithmus
Punkt
Ausbreitungsfunktion
Validität
Content <Internet>
Physikalisches System
p-Block
Vorzeichen <Mathematik>
Nichtunterscheidbarkeit
Regelkreis
Inhalt <Mathematik>
p-Block
Schlüsselverwaltung
Kette <Mathematik>
Aggregatzustand
Ebene
Bit
Subtraktion
Hash-Algorithmus
Public-Key-Infrastruktur
Web log
Klasse <Mathematik>
Ausbreitungsfunktion
Gruppenkeim
Content <Internet>
Kartesische Koordinaten
Datenmissbrauch
Physikalische Theorie
Demoszene <Programmierung>
Benutzerbeteiligung
Umwandlungsenthalpie
Konsistenz <Informatik>
Vorzeichen <Mathematik>
Speicher <Informatik>
Datenstruktur
Inklusion <Mathematik>
E-Mail
Clique <Graphentheorie>
Kette <Mathematik>
Softwaretest
Addition
Kraftfahrzeugmechatroniker
Sichtenkonzept
Graph
Kategorie <Mathematik>
Physikalischer Effekt
Kryptologie
Validität
Hochverfügbarkeit
Systemaufruf
Physikalisches System
Quellcode
Zeitzone
Mechanismus-Design-Theorie
Zugriffskontrolle
Flächeninhalt
Beweistheorie
Gamecontroller
Information
p-Block
Schlüsselverwaltung
Term
Aggregatzustand
Public-Key-Kryptosystem
Subtraktion
Folge <Mathematik>
Metadaten
Web log
Kartesische Koordinaten
Identitätsverwaltung
Element <Mathematik>
Zeitstempel
Netzwerktopologie
Metadaten
Bildschirmmaske
Knotenmenge
Elektronische Unterschrift
Nichtunterscheidbarkeit
Addition
Zeitstempel
Zeiger <Informatik>
Maschinelles Sehen
E-Mail
Kette <Mathematik>
Analysis
Nichtlinearer Operator
Wurm <Informatik>
Indexberechnung
p-Block
Zeiger <Informatik>
Elektronische Unterschrift
Netzwerktopologie
Mapping <Computergraphik>
Datenfeld
Datenstruktur
Automatische Indexierung
Speicherabzug
Information
p-Block
Public-Key-Kryptosystem
Addition
Lineares Funktional
Multifunktion
Kreisfläche
Content <Internet>
Indexberechnung
Zahlenbereich
Systemaufruf
Rechenbuch
Auswahlverfahren
Formale Semantik
Netzwerktopologie
Chiffrierung
Knotenmenge
Automatische Indexierung
Beweistheorie
Konditionszahl
Addition
Inhalt <Mathematik>
p-Block
Schlüsselverwaltung
Widerspruchsfreiheit
Analysis
Private-key-Kryptosystem
Public-Key-Kryptosystem
Multifunktion
Prozess <Physik>
Klasse <Mathematik>
Zahlenbereich
Computerunterstütztes Verfahren
Chiffrierung
Knotenmenge
Automatische Indexierung
Digitaltechnik
Elektronischer Programmführer
p-Block
Ordnung <Mathematik>
Normalvektor
Extreme programming
Schlüsselverwaltung
Streuungsdiagramm
Analysis
Kollaboration <Informatik>
Punkt
Gruppe <Mathematik>
Stellenring
Zahlenbereich
Spieltheorie
Datenmissbrauch
Konfiguration <Informatik>
Open Innovation
Rechenschieber
Chiffrierung
Beweistheorie
Computersicherheit
Information
p-Block
Körpertheorie
Inklusion <Mathematik>
Simulation
Implementierung
Gemeinsamer Speicher
Familie <Mathematik>
Kartesische Koordinaten
Computerunterstütztes Verfahren
Service provider
Internetworking
Netzwerktopologie
Datenmanagement
Kryptologie
Vorzeichen <Mathematik>
Mustersprache
Computersicherheit
E-Mail
Kraftfahrzeugmechatroniker
Suite <Programmpaket>
Lineares Funktional
Kategorie <Mathematik>
Benutzerfreundlichkeit
Computersicherheit
Datenhaltung
Güte der Anpassung
Spieltheorie
Systemaufruf
Profil <Aerodynamik>
Quellcode
Digitale Photographie
Open Innovation
Kollaboration <Informatik>
Chiffrierung
Forcing
Grundsätze ordnungsmäßiger Datenverarbeitung
Projektive Ebene
Simulation
Schlüsselverwaltung
Aggregatzustand
Telekommunikation
Folge <Mathematik>
Selbst organisierendes System
Automatische Handlungsplanung
Abgeschlossene Menge
Datenmissbrauch
Whiteboard
Leck
Knotenmenge
Reelle Zahl
Spieltheorie
Torus
Diskrete Simulation
Datentyp
Zusammenhängender Graph
Open Innovation
Datenstruktur
Implementierung
Kollaboration <Informatik>
Datenmissbrauch
Graph
Protokoll <Datenverarbeitungssystem>
Schlussregel
Physikalisches System
Mereologie
Körpertheorie
Umsetzung <Informatik>
Sichtenkonzept
Mathematisierung
Gruppenkeim
Zahlenbereich
E-Mail
Ereignishorizont
Marketinginformationssystem
Formale Semantik
Chiffrierung
Informationsmodellierung
Arithmetischer Ausdruck
Generator <Informatik>
Rechter Winkel
Mereologie
Bandmatrix
Addition
p-Block
Schlüsselverwaltung
Prozess <Physik>
Metadaten
Klasse <Mathematik>
Content <Internet>
Zahlenbereich
Derivation <Algebra>
Identitätsverwaltung
Rechenbuch
Internetworking
Zeitstempel
Chiffrierung
Elektronische Unterschrift
Hash-Algorithmus
Addition
Inhalt <Mathematik>
Datenstruktur
Kette <Mathematik>
Umwandlungsenthalpie
Kraftfahrzeugmechatroniker
Lineares Funktional
Datenmissbrauch
Graph
Indexberechnung
p-Block
Zeiger <Informatik>
Netzwerktopologie
Verkettung <Informatik>
Datenstruktur
Wurzel <Mathematik>
Information
p-Block
Schlüsselverwaltung
Hypermedia
Medianwert
Systemprogrammierung
Mehrrechnersystem

Metadaten

Formale Metadaten

Titel Modern key distribution with ClaimChain
Untertitel A decentralized Public Key Infrastructure that supports privacy-friendly social verification
Serientitel 34th Chaos Communication Congress
Autor prometheas
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/34864
Herausgeber Chaos Computer Club e.V.
Erscheinungsjahr 2017
Sprache Englisch

Inhaltliche Metadaten

Fachgebiet Informatik
Abstract ClaimChain is a Public Key Infrastructure unique in that it can operate in fully decentralized settings with no trusted parties. A vouching mechanism among users, similar to the Web of Trust, assists with social authentication but without revealing the users' social graph. High-integrity data structures prevent equivocation and help detect compromises; the protocol can support generic claims (conventional PGP, modern OTR/Signal etc.); and a prototype evaluation indicates that ClaimChain can scale.
Schlagwörter Resilience

Zugehöriges Material

Folgende Ressource ist Begleitmaterial zum Video
Video wird in der folgenden Ressource zitiert

Ähnliche Filme

Loading...
Feedback