Léo Colisson
  • Member for 3 years, 10 months
  • Last seen this week
1 answers
7 votes
548 views
What is universal composability guaranteeing, specifically? Where does it apply, and where does it not?
Accepted answer
15 votes

The different guarantees of security In security proofs, you have several guarantees that you can obtain on the security of a protocol. The most famous are maybe the following: game-based security ...

View answer
2 answers
18 votes
3k views
Simulation-based proofs and universal composability proofs
4 votes

My goal is just to complete Mikero's answer, notably on that part: Also, I would be most grateful if you should show me example proofs in the UC framework. The shorter/easier the better, just so I ...

View answer
1 answers
3 votes
82 views
Is it common/valid to hardcode an element of a language into a simulator?
2 votes

In fact I got confused for no reasons (thanks Michael): we can just define two hybrid games (we just sketch the proof here): in the first game we replace the $\textsf{Proof}(k, (d, r))$ ($r$ is the ...

View answer
1 answers
1 votes
85 views
Differential privacy what does "where the probability is taken over the randomness used by the algorithm" mean?
2 votes

So here $\mathcal{M}$ is, as you wrote, a "randomized mechanism", so it means that for one entry $D$ it can output different values. For example, you can imagine that on entry $D = 1$, $\...

View answer