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 perfect-secrecy
Search options not deleted
user 44136
Confidentiality in a very strong sense. Ciphers reaching perfect-secrecy can't be broken to disclose informations over the plaintext from the ciphertext, even with unlimited computing power. The most known example cipher reaching perfect screcy is the one-time-pad.
2
votes
2
answers
271
views
A perfect $(2; 2)$-threshold scheme
Given a symmetric encryption scheme with $|K| = |C| = |M|$ that provides perfect
secrecy, it is possible to share a secret $s ∈ M$ between two players by giving one
player a key $k ∈ K$ and the other …
- 139
1
vote
2
answers
251
views
Distributing shares in a particular monotone access structure
Consider 6 people, $A,B,C,D,E,F$ and a secret. Construct a scheme which enables the following subsets of people to retrieve the secret:
three players from the set $\{A,B,C,D\}$
two players from the …
- 139