Cc Countersignature Disclosure with airSlate SignNow

Cc countersignature disclosure

Hey okay so I'm going to tell you about a bunch of results we have about this thing called the conditional disclosure of Secrets I'm going to start by telling you what it is so this is the setting we have so you have this function f on this predicate F on two inputs it's it public everyone knows this and you have three parties Alice who knows X 1 of the inputs to err Bob who knows why and Carol who knows both x and y in addition Alice and Bob how some shared randomness and the secret sa4 know think of the secret as a single bit a single bit secret s and this randomness and they each compute one message based on whatever they know and send it to Carol this is all that happens and that objective is is to do two things first if the predicate F evaluates to 1 on their inputs on their own x and y then they're supposed to reveal the secret to Carol Kyle is supposed to be able to recover the secret given just the messages and x and y on the other hand if the predicate is 0 on x and y then they want to hide the secret from carol and if we formalize because we are saying that you can simulate the distribution of the messages without knowing the secret so if we can simulate it without knowing the secret that means it can have some much information about the secret right so they want to do these two things they want to reveal the secret to Carol if and only if the function evaluates to 1 on the inputs so each of them knows one part of the input yeah so they want to do this while minimizing the amount of communication they undertake so this is a measure of complexity in this model you want to minimize the amount of total amount of communication that happens in the protocol so this is this is a model this is the so you what we want to do is we want to study the complexity of different functions in this model the communication you need to realize different predicates and oh yeah so sometimes we will also concern ourselves with the amount of randomness used but but the main measure of complexity is the amount of communication right so this is the this is the conditional distortion of secrets and why do we want to study this it turns out it's related to a lot of different so I won't really have time to go into too many of these things but perhaps the prime with one of primary importance is its relationship with attribute based encryption it has it by itself it's it's a very simplified version of our tale based encryption that gives you like a single time security but there are is more to that I won't have time to go into this...