Pinned

1. novel method for choosing provably r... novel method for choosing provably random, unique values from a set, secret to each party until revealed

   1

   (for example, choosing cards from a deck for a decentralized game of poker)

   2

   3

   Assume two parties: Alice and Bob. Firstly, the parties should agree on what values will be used. For something like poker, this would be IDs representing the 52 cards. For this example, there will be n=4 values, the numbers 1 through 4. A party is arbitrarily chosen to begin the encryption sequence, which will be Alice for this example. Assume all communications between parties are signed and encrypted. Both parties will commit to certain data by publishing hashes of them (with a nonce for certain values to prevent bruteforcing), which allows for later proving of honest gameplay. Such a system requires both parties to “prove” their “cards” (secret values) at the end of the game, or the consensus mechanism will enforce a sort of justice, giving their entire table balance or “buy-in” to honest parties based on the rules of the game that can still be applied, which comes at no disadvantage to honest users. The funds in use for any game can be controlled by any number of mechanisms, including trust, trusted arbitrators, or decentralized “smart contracts”.

   4

   5

   Alice will now generate a secret key a, 256 bits of random data s, and a private/public keypair (x/y) She will commit to these by publishing sha256(a), sha256(s), and sha256(y). Bob will generate n-1=3 random nonces and publish their hashes (n1, n2, n3).

2. bitcointechwiki bitcointechwiki Public

   A modern resource for bitcoin information and a second-generation, visual transaction editor

   JavaScript 1