Fully Deniable Communication and Computation
>>Hi. Um, and thank you for inviting me to speak at the Entity Research Summit. And congratulations for NTT for setting up the neuroses club in the area. Okay, so I'm gonna talk about fully by deniable encryption and multiply the competition. And, uh, this is joint work with park from Harvard. And Santa will bring a, uh, she structurally right now in Russia during the rest. Um, so So so consider thesis, uh, two kids, which maybe some of you still remember its violence for check the incredible kids. And they are want they want to talk to each other privately without her mother learning what talking about. So here they are using this lead pipe, which is that cannot be secure Channel and and violent can say to that track that she doesn't want to do her homework and check it was the watch movie. And she knows that the judge will understand what she says. We hear what she says, but her mother, their mother, is not going to anything because it z this lead pipe. She doesn't know what they're talking about. Um and and and we know how to implement this actually in without lead pipes in the software will Do you have encryption, which, you know, you know, for I know, uh, 40 for the last 40 years or so, but actually for many more s. Oh, this is great. Encryption gives us private communication against, uh, eavesdropping adversary. So passive adversaries s but But you know that mothers can be more than passives. What if the mother he goes and asks Pilot that? What did you talk? What do you say to judge it So you know, if valid, really said, you know, used this'll end pipe. She can say whatever she wants to say. I actually said that I was study, and then the mother goes to judge. I can ask him what did about tell you, and she said that she was studied and the mother still cannot tell anything about what happened. She doesn't know trillions. Death was sent or not. Um, in fact, even if violence said that she was studying and and Jackson said something else that you know, she said she was she rather watch movie. Even then the mother doesn't know who was right. I mean, not from the pipe music. Look them in the eye and not this way, but not from the communication she doesn't. Andi. In fact, we could go on like this, and, you know, the lead type doesn't help at all to understand what really have. And this is really another very important form off this really secure channels that it doesn't allow external parties. Course, there's, uh, certain what really happened. Even when they asked to see all the internals of all the parties. In fact, even further, the Violet Jack Jack have no way to actually convince the mother that this is what happened. Even if you want, right, they have no way of actually proving to the mother that they said this and not the other thing with this lead pipe. So the question is can be obtained a similar effects with, you know, software encryption. Uh, can we have an encryption scheme that has the same sort of properties? So we know that Peoria, the total encryption doesn't have this property. That encryption leaves traces. So there's this cipher text that that the mother of the course of seized. Then when the mother goes toe the parties and you know the ballot judge, you can ask him uh, give me. Show me your randomness. Show me all the internals. I want to see what really? How you generated the text and how you decrypted it with no money. Encryption is only one way that, but inject, checking opened the suffer text, and therefore, there is no real privacy anymore. Um, so So this is the case. So so really to do to address this issue? The this this concept of deniable encryption that was considered, uh, you know, many years ago. Andi idea here is that you wanted encryption scheme that provides, uh, protection of privacy. Uh, on ability, toe keep private. You really, really, really value. And maybe, ah, fake or lie about what you say in a convincing way, even against such a course. Uh huh. So and so? So the idea is that, you know, So they actually do you think of three types here, So there is centered in apple. So we're just going us to center off the off the message. You know how How did you encrypt the message? Show me your encryption. Andalus Suing The decryption key is public. Um, and if you go to the receiver and ask him show me your decryption key. I want to see how you decrypted. And you can also think about natural case where the course actually goes to both parties and ask them for the for the internals and compares one against the other. Right? So this is the bite inability concept. Andi, you can, of course, naturally generalize it. Not just to encryption to, say, two party competition soon here, Violent and Jack. Jack. You know, uh, maybe not even trust each other fully, But they want toe compute together, you know? Or, you know, do they actually know a kid they both know and rapes in school, Right. So, So, So violent has her own list of kids, and she knows grapes and injection to, and they want to do this to Paris ST secure competition to figure out if they keep the both. And so if they have this ideal trusted party or stay for somewhere where they can actually do the security applications uh um, securely then they can, of course, learned the answer without learning anything else. And also, if the mother comes in after the fact and ask them, you know who I see that you were trying to figure out who very school, you know. So tell me what you did. Tell me your inputs them you are supposed to give me all the randomness. And And I want to know for the kids that you know, that vaping school. So if they were using such such a physically, I didn't secure gadget then, uh, then they can say You know why? You know? So So what is the state of, I don't know, anybody Invasion did Jack this theater and I got nothing into something or nothing. Jake Jackson. Consistency and off course. Mother has no way of knowing if this is true. No. And even if, uh, injected decides to tell the truth and actually tells is really important. Really put real randomness. And, uh, no randomness here and violent tells still here. Nothing. Nothing that the mother has no way of knowing which one is like. She clearly some of one of them is language. Doesn't know which one. I mean, chicken again looked deep in the eye, but not from the communication. She cannot figure out. Um, so s so we want to get something like that for for two party competition. Uh, and and and again, eso again, again, again. The case that, you know, one is like going to the truth is still don't know. Um, so the question is there a protocol that that one is still behavior, and, uh, incredible. How do you define us? Uh, and the point is that, you know, Okay, 11 further thing toe. Think about, you know, this doesn't shouldn't end with two parties can think about three or more parties on, uh, and the same thing happens. You know, just maybe the trust structure, the consistency structure becomes more complicated. Uh, you know, you could buy groups of people which is consistent with each other and not without, um Okay, so So what are our results here? So first result is regarding encryption. So we come up with the first bite, the novel communication protocol. It's not encryption because it's three messages. Uh, so it is three messages, and it is this way need a reference string, which is like, programs in the sky. And but it's a short registering. I mean, one short programs that everybody in the world uses for the encryptions for the entire duration of time. and our assumptions are some expansion, Leo in one functions, uh, and on. But just to say that what was done previously? It was just senator deniable or receiver deniable, um, And then and nothing that we do is that actually way define and also obtained this extra property, which we call off the record inability which talks with you about the case where, as I said before, that one party, uh uh, is saying one thing and the other practicing nothing they insisted. So they cannot. There is no way for them to frame each other. Um, and the way the other result is regarding a multiparty function evaluation on Dhere, we come up with the first all deniable secure function evaluation for quote Well, you know, I mean, I mean that the protocol with the adversary or the coarser expect to see all off the transcript of the competition, including all the randomness in all the internal state of all the parties eso superiors results in this area always assumed that you know, either the course only can concourse on some of the parties or if you can force all the parties and there is some some physical gadget, uh, which is crucial information about the personnel puts and you know, nobody can see inside, so no, here, we actually that the Attackers see everything. Uh, because they think they see everything on we can still provide inability onda protocol. Also, our protocols also withstand inconsistencies. Mean the case off this off the record style that one party says one thing partisans don't think. But this is only in the case of two parties and only for functions where the input size is polynomial in play. Put size. Uh, domain. Um, so in this actually interested open question how to extend it beyond that. Uh, so just to say that this is kind of it's a surprising thing that you can even do such thing, because what it allows you to do is actually such to completely rewrite history. Eso you during your competition on. Then somebody comes, and that will show me everything that happened. All the runners, all the entire transcript, the competition from beginning to the end. And you can now tell them something else. Not something that really happened. I mean, they see, you know, the public messages they see it on thistle is un contestable, but you can show different internals that there are very different than what really happened. And still nobody can catch you. So it's really some sense. Uh, who knows what's really happened? Um, so anyway, so So this is the, uh this is the result. Let's just say a few words about fully deniable encryption. Uh, just toe give a more detailed So So So So, how do you define this? Fully deniable encryption. So first I want to say that, you know, if you just, uh if the parties have appreciate key then, uh, deniability is with these because what you know, you just in orderto cryptic message just want some part of the key. And this one temple is completely deniable, right? Because you can just take this self a text and claim that it was any message encryption off any message off your choice. But just, you know, extra it. But just coming up with the key, which is the Solvents Architects as a message of futures. So this is completely diamond by both parties, and even it's off the record because if the two parties say different things, there's no way to know what's right. So Eh, so what? But it means that, you know, the hard part is actually had to come up with this shirt key, uh, in a deniable way. So you can actually later argued that this key was an, um so s so we need kind of deniable key exchange, and then this is what we do. So we come up with this idea by by the application of what? This what this means. So it's a protocol, you know, for two parties, uh, change, keep with messages and which gives you the ability to life. Somebody asked you which was key and claim it was anything, uh, later. So more formally. So we have two parties. One You know, this is the key change protocol for one party, and this is the kitchen for the other party in each party also is equipped with this faking algorithm. This is s faking arctic. I keep, you know, Senator, receiver, Even though it's not teach change, it's affecting and breaking. Allows you to come up with fake randomness. That demonstrate kills anything and we want correctly since semantic security as usual and we want toe this s fake takes a transcript and the randomness and the old key in the nuclear that you want. Andi comes up with fake randomness such that, uh um and this is you know, that that consistent with this new key, k prime and the same for the receiver. It comes up with a new randomness. The assistant to the crime and the requirement is that, uh, the attack. I cannot tell the difference between the experiment when you know the key key was exchanged. These transcripts respecto the real key or the case where the key was exchanged, and then the faking accurately going folk What? The adversary seizes the actual transcript, but then opening to a different. So there's a distinguished group. Um, And then what if the parties that were okay then there is another requirement there that says that even if the parties you know, one of them face, the other one doesn't and they then you can't tell which one will effect in which one wants to tell the truth. Onda point is that this to this to produce properties together really give you what you would like for my dearly your channel, even with respect toe courses. Um, so just to point out that you know this, this properties hold only if the parties in the follow the protocol during the execution actually choose randomness is they should. Otherwise things does work. In fact, otherwise, there's nothing that could work because the party's chief from the beginning and just use the terroristic protocol instead of randomized or just, you know, just randomness, which is predetermined. And, of course, nothing you can do. Uh, however, you know, there are, of course, interesting situations where it is. You know, it's reasonable to trust that the parties are actually using the randomness Aziz instructed during the execution of the protocol, for instance, we're thinking about voting this something can be forced, uh, by the voting booth, but you know, other situations. But this is kind of like essentially eso maybe another minute to say a few words about, you know, just like construction. How it kind of works in, you know, in general. So So we have, like, a three months, three rounds protocols. So we have four programs, you know, two from each party don't to deal with the three messages. Then we have a faking program for each party, so the way it works, you know, first, the violent here is has this is Harris randomness and actually chooses the key that they're going Thio agree ahead of time. It inputs to the first program which is going to think of it is the office care program black box program. And there's the message. First message is basically a harsh appear f off the K and then the, uh and then the responder gets this message has its own randomness and outputs. Another message, which is the hash off the first message agronomists. And then the third message now is going to be a new encryption off the key on the hashes and the end to a previous messages. This is, ah, company encryption off this one long spring and then the fourth with the fourth program just takes the randomness off the receiver and the two messages and put it in. And then I'll put the key, which is decrypted essentially the Crips, the subtextual from here in the old checks, right? And then the faking programs. What they do, they just take those. The transcript and the cookie and the new key and the striking program here are puts a new randomness for the senator and this one There's a new randomness for the receiver and the way it does near random estrogen offering work eyes, uh, is again It's kind of fact natural a t least the face of it. It uses the seeking hidden triggers idea off, off, so high in waters for descending on the inability that, you know, trigger each one of those programs toe put actually write message even when you get this, uh, crime on eventually this k problems are Well, the problem is that this scene in triggers, you know, give you local consistency for each problem by itself. This was this was the east their goal. But there is no global consistency about those six programs together and and get the six programs together to be consistent with the fact that the key would actually keep prominent K is high in contribute. And this is something that we become the main challenge of this work. This also, I did this three messages because if you have only to then there is no way to get a double consistency. Ah, s O s. So this is, uh this is the test on just to say about, you know, the future. So definitely we want stronger than ability for for MPC. As I said, we just give partial results there on. Then there is kind of, like some very interesting questions. One is like in general, You know, we know that your is very nice, but in many cases, we actually can do things without, uh but in this situation with prosecution, but maybe the inability of one of the very few cases where actually, we don't have any other way to do things out of the Neo. Is it really essential? Can we prove it? You know, and if not, can we do without? Can we get around CRS? Can you actually do with public friend of mysterious? Uh, you know, and more generally? Uh, no. We actually, uh, sweated a lot. You know, spit blood. In order to make this thing work with Leo and because I always really hard to work with, you know, would agree toe, find some some some general set of tools to work more easily. I was there. Um, Louis, thank you very much on death's
SUMMARY :
So the idea is that, you know, So they actually do you think of three types here,
SENTIMENT ANALYSIS :
ENTITIES
Entity | Category | Confidence |
---|---|---|
Russia | LOCATION | 0.99+ |
two parties | QUANTITY | 0.99+ |
Jackson | PERSON | 0.99+ |
three messages | QUANTITY | 0.99+ |
Louis | PERSON | 0.99+ |
two messages | QUANTITY | 0.99+ |
Jake Jackson | PERSON | 0.99+ |
two | QUANTITY | 0.99+ |
third message | QUANTITY | 0.99+ |
both parties | QUANTITY | 0.99+ |
each party | QUANTITY | 0.99+ |
two kids | QUANTITY | 0.99+ |
first bite | QUANTITY | 0.99+ |
First message | QUANTITY | 0.99+ |
one party | QUANTITY | 0.99+ |
six programs | QUANTITY | 0.99+ |
NTT | ORGANIZATION | 0.99+ |
fourth | QUANTITY | 0.99+ |
Santa | PERSON | 0.99+ |
Leo | PERSON | 0.99+ |
three messages | QUANTITY | 0.99+ |
first message | QUANTITY | 0.99+ |
Jack | PERSON | 0.99+ |
Aziz | PERSON | 0.99+ |
three months | QUANTITY | 0.99+ |
both | QUANTITY | 0.99+ |
each problem | QUANTITY | 0.99+ |
three types | QUANTITY | 0.99+ |
two party | QUANTITY | 0.99+ |
first program | QUANTITY | 0.98+ |
One | QUANTITY | 0.98+ |
one | QUANTITY | 0.98+ |
fourth program | QUANTITY | 0.98+ |
four programs | QUANTITY | 0.98+ |
first | QUANTITY | 0.97+ |
one way | QUANTITY | 0.97+ |
three rounds | QUANTITY | 0.97+ |
apple | ORGANIZATION | 0.97+ |
Harvard | ORGANIZATION | 0.97+ |
one short programs | QUANTITY | 0.97+ |
40 | QUANTITY | 0.96+ |
Entity Research Summit | EVENT | 0.96+ |
one thing | QUANTITY | 0.96+ |
one functions | QUANTITY | 0.94+ |
three | QUANTITY | 0.93+ |
11 | QUANTITY | 0.93+ |
Peoria | ORGANIZATION | 0.91+ |
Dhere | ORGANIZATION | 0.87+ |
many years ago | DATE | 0.87+ |
first result | QUANTITY | 0.87+ |
Andi | PERSON | 0.84+ |
Violet Jack Jack | PERSON | 0.83+ |
Harris | PERSON | 0.81+ |
more parties | QUANTITY | 0.81+ |
each one | QUANTITY | 0.78+ |
Paris ST | LOCATION | 0.77+ |
double | QUANTITY | 0.75+ |
one temple | QUANTITY | 0.67+ |
Andalus | PERSON | 0.66+ |
trillions | QUANTITY | 0.62+ |
last 40 years | DATE | 0.62+ |
CRS | ORGANIZATION | 0.59+ |
each | QUANTITY | 0.54+ |