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 provable-security
Search options not deleted
user 87346
A primitive or protocol with provable security is accompanied by a mathematical proof that shows how to reduce the security claims about the protocol to a set of assumptions.
2
votes
1
answer
300
views
Constructing a mac scheme secure to regular definition but insecure to special case
The mac-forge security game for mac schemes looks like this:
$k \leftarrow \operatorname{Gen}(1^n)$;
$(m,t) \leftarrow A^{\operatorname{MAC}_k(⋅)}(1^n)$;
Let $Q$ denote the set of all queries that $A …
- 143