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 commitments
Search options not deleted
user 64
A commitment scheme is a protocol where one party commits themselves to a secret value without revealing it. At a later point, the value can be revealed.
3
votes
Is there a cumulative commitment scheme?
One approach that may work is the following. You can represent the accumulated values as a polynomial, where the roots are equal to the messages:
User $1$ creates a representation of $P_1(x)=(x-C(1) …
- 8,717
21
votes
Accepted
How to fairly select a random number for a game without trusting a third party?
Good randomized commitments are based on discrete logarithms but you could construct one (with reasonable safeness) using a hash function by generating a large random value $a_i$ and then computing your …
- 8,717
4
votes
Accepted
What type of hash functions provides non-malleability of hash digests?
Commitment functions should be at least hiding and binding, and in your case, you want non-malleable.
Using a hash function as a commitment does require addition assumptions on the hash that are not …
- 8,717