Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with protocol-analysis
Search options not deleted
user 55541
Protocol analysis is the detailed analysis of the security of an abstract or concrete cryptographic protocol.
3
votes
0
answers
169
views
Equivalents of Yao's Xor lemma to rounds, or other hardness amplification methods?
Simple question:
I just learn the existence of the great Yao's Xor lemma (see a quick sum-up at the end of this post). I'd like to use a similar argument, but instead of a simple function, I've a two …
- 1,511
4
votes
Simulation-based proofs and universal composability proofs
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 ca …
- 1,511
40
votes
Accepted
What is universal composability guaranteeing, specifically? Where does it apply, and where d...
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
se …
- 1,511