How to certify a secret decision revealed on a delay in a play-by-post game?
Clash Royale CLAN TAG#URR8PPP
up vote
36
down vote
favorite
In a play-by-post game that requires a player to commit to a secret decision and later reveal that decision publicly, how can a player certify that they did so honestly without relying on good faith?
Consider the following game scenario.
- Alice commits to a decision, like pre-programming an action she will take. An onlooker might notice she's doing something but they wouldn't know the particulars.
- Though Bob doesn't know exactly what Alice is up to, he commits to a decision in response to that, like reacting to stop her. Resolving his decision will depend on resolving her decision.
- Alice has to reveal what her committed decision was after the fact in order to resolve it at this point along with Bob's reaction to it. If she's being honest or has a way to certify what her decision was, this is fine. If she is able to lie, she could change her decision retroactively.
Are there common tools, techniques, or conventions to support this? At a table, Alice could simply write her decision in a folded note card and reveal it later; or in a board game, she could play her action card face down and reveal it later. These common table conventions don't translate well to online play. So, how can Alice certify her secret decision to be revealed on a delay?
Assume the following about the game, its rules, and the players:
The system is not freeform. It has rules that match the scenario given above.
Even if the players know and trust each other, they still need (or want) a way to certify their decisions without relying on good faith.
The gamemaster might also be a player (possibly even an adversarial one) and is not exempt from the need (or want) of a way to certify their decisions without relying on good faith.
play-by-post
asked Nov 22 at 16:49
Bloodcinder
18k260118
add a comment |
up vote
36
down vote
favorite
In a play-by-post game that requires a player to commit to a secret decision and later reveal that decision publicly, how can a player certify that they did so honestly without relying on good faith?
Consider the following game scenario.
- Alice commits to a decision, like pre-programming an action she will take. An onlooker might notice she's doing something but they wouldn't know the particulars.
- Though Bob doesn't know exactly what Alice is up to, he commits to a decision in response to that, like reacting to stop her. Resolving his decision will depend on resolving her decision.
- Alice has to reveal what her committed decision was after the fact in order to resolve it at this point along with Bob's reaction to it. If she's being honest or has a way to certify what her decision was, this is fine. If she is able to lie, she could change her decision retroactively.
Are there common tools, techniques, or conventions to support this? At a table, Alice could simply write her decision in a folded note card and reveal it later; or in a board game, she could play her action card face down and reveal it later. These common table conventions don't translate well to online play. So, how can Alice certify her secret decision to be revealed on a delay?
Assume the following about the game, its rules, and the players:
The system is not freeform. It has rules that match the scenario given above.
Even if the players know and trust each other, they still need (or want) a way to certify their decisions without relying on good faith.
The gamemaster might also be a player (possibly even an adversarial one) and is not exempt from the need (or want) of a way to certify their decisions without relying on good faith.
play-by-post
asked Nov 22 at 16:49
Bloodcinder
18k260118
3
As a useful practical example where the described scenario would crop up, combat in Mouse Guard (and presumably other Burning Wheel system games) is resolved with the GM and players each secretly deciding on three actions before revealing them all at once and resolving the round of combat
– Pingcode
Nov 23 at 8:48
3
@Pingcode That’s a great example too of a mechanic where even a trusted GM still should not be seeing the message ahead of time. (For the unfamiliar: Mouse Guard combat is centrally about attempting to predict the opposition’s secretly-recorded maneuvers, which makes it impossible to disregard knowing that information ahead of your own choices.) I wouldn’t want the additional burden of trying to ignore full knowledge while trying to play my side of MG’s fog-of-war combat fairly.
– SevenSidedDie♦
Nov 25 at 18:06
1
I asked the question in a game-agnostic fashion because I wanted RPG.SE's expertise, but in full disclosure the game I'm playing is Tragedy Looper, which is a 1 (gamemaster) vs 3 (other players) deduction board game. Many answers and comments on those answers seem to be telling me that I'm guilty of playing a badwrongfun game, but the scenario I have described in my question is simply how some games work, and the need for decision certification doesn't go away because that scenario is unconventional.
– Bloodcinder
Nov 26 at 13:10
In fact, I'm playing with a group of close friends, and there's plenty of trust to go around. One can still desire a way to certify their own honesty even when one's honesty isn't suspect.
– Bloodcinder
Nov 26 at 13:15
Not that people should insinuate that you shouldn't play such a game regardless... But this really is why it helps to specify the game system you're playing in your post. Answers don't necessarily have to be specific to that one system, but at the least you'll ideally weed out the people providing answers that don't work in that system.
– V2Blast
2 days ago
add a comment |
up vote
36
down vote
favorite
up vote
36
down vote
favorite
In a play-by-post game that requires a player to commit to a secret decision and later reveal that decision publicly, how can a player certify that they did so honestly without relying on good faith?
Consider the following game scenario.
- Alice commits to a decision, like pre-programming an action she will take. An onlooker might notice she's doing something but they wouldn't know the particulars.
- Though Bob doesn't know exactly what Alice is up to, he commits to a decision in response to that, like reacting to stop her. Resolving his decision will depend on resolving her decision.
- Alice has to reveal what her committed decision was after the fact in order to resolve it at this point along with Bob's reaction to it. If she's being honest or has a way to certify what her decision was, this is fine. If she is able to lie, she could change her decision retroactively.
Are there common tools, techniques, or conventions to support this? At a table, Alice could simply write her decision in a folded note card and reveal it later; or in a board game, she could play her action card face down and reveal it later. These common table conventions don't translate well to online play. So, how can Alice certify her secret decision to be revealed on a delay?
Assume the following about the game, its rules, and the players:
The system is not freeform. It has rules that match the scenario given above.
Even if the players know and trust each other, they still need (or want) a way to certify their decisions without relying on good faith.
The gamemaster might also be a player (possibly even an adversarial one) and is not exempt from the need (or want) of a way to certify their decisions without relying on good faith.
play-by-post
asked Nov 22 at 16:49
Bloodcinder
18k260118
In a play-by-post game that requires a player to commit to a secret decision and later reveal that decision publicly, how can a player certify that they did so honestly without relying on good faith?
Consider the following game scenario.
- Alice commits to a decision, like pre-programming an action she will take. An onlooker might notice she's doing something but they wouldn't know the particulars.
- Though Bob doesn't know exactly what Alice is up to, he commits to a decision in response to that, like reacting to stop her. Resolving his decision will depend on resolving her decision.
- Alice has to reveal what her committed decision was after the fact in order to resolve it at this point along with Bob's reaction to it. If she's being honest or has a way to certify what her decision was, this is fine. If she is able to lie, she could change her decision retroactively.
Are there common tools, techniques, or conventions to support this? At a table, Alice could simply write her decision in a folded note card and reveal it later; or in a board game, she could play her action card face down and reveal it later. These common table conventions don't translate well to online play. So, how can Alice certify her secret decision to be revealed on a delay?
Assume the following about the game, its rules, and the players:
The system is not freeform. It has rules that match the scenario given above.
Even if the players know and trust each other, they still need (or want) a way to certify their decisions without relying on good faith.
The gamemaster might also be a player (possibly even an adversarial one) and is not exempt from the need (or want) of a way to certify their decisions without relying on good faith.
play-by-post
play-by-post
asked Nov 22 at 16:49
Bloodcinder
18k260118
asked Nov 22 at 16:49
Bloodcinder
18k260118
edited Nov 26 at 15:55
asked Nov 22 at 16:49
Bloodcinder
18k260118
asked Nov 22 at 16:49
Bloodcinder
18k260118
asked Nov 22 at 16:49
Bloodcinder
18k260118
18k260118
3
As a useful practical example where the described scenario would crop up, combat in Mouse Guard (and presumably other Burning Wheel system games) is resolved with the GM and players each secretly deciding on three actions before revealing them all at once and resolving the round of combat
– Pingcode
Nov 23 at 8:48
3
@Pingcode That’s a great example too of a mechanic where even a trusted GM still should not be seeing the message ahead of time. (For the unfamiliar: Mouse Guard combat is centrally about attempting to predict the opposition’s secretly-recorded maneuvers, which makes it impossible to disregard knowing that information ahead of your own choices.) I wouldn’t want the additional burden of trying to ignore full knowledge while trying to play my side of MG’s fog-of-war combat fairly.
– SevenSidedDie♦
Nov 25 at 18:06
1
I asked the question in a game-agnostic fashion because I wanted RPG.SE's expertise, but in full disclosure the game I'm playing is Tragedy Looper, which is a 1 (gamemaster) vs 3 (other players) deduction board game. Many answers and comments on those answers seem to be telling me that I'm guilty of playing a badwrongfun game, but the scenario I have described in my question is simply how some games work, and the need for decision certification doesn't go away because that scenario is unconventional.
– Bloodcinder
Nov 26 at 13:10
In fact, I'm playing with a group of close friends, and there's plenty of trust to go around. One can still desire a way to certify their own honesty even when one's honesty isn't suspect.
– Bloodcinder
Nov 26 at 13:15
Not that people should insinuate that you shouldn't play such a game regardless... But this really is why it helps to specify the game system you're playing in your post. Answers don't necessarily have to be specific to that one system, but at the least you'll ideally weed out the people providing answers that don't work in that system.
– V2Blast
2 days ago
add a comment |
3
As a useful practical example where the described scenario would crop up, combat in Mouse Guard (and presumably other Burning Wheel system games) is resolved with the GM and players each secretly deciding on three actions before revealing them all at once and resolving the round of combat
– Pingcode
Nov 23 at 8:48
3
@Pingcode That’s a great example too of a mechanic where even a trusted GM still should not be seeing the message ahead of time. (For the unfamiliar: Mouse Guard combat is centrally about attempting to predict the opposition’s secretly-recorded maneuvers, which makes it impossible to disregard knowing that information ahead of your own choices.) I wouldn’t want the additional burden of trying to ignore full knowledge while trying to play my side of MG’s fog-of-war combat fairly.
– SevenSidedDie♦
Nov 25 at 18:06
1
I asked the question in a game-agnostic fashion because I wanted RPG.SE's expertise, but in full disclosure the game I'm playing is Tragedy Looper, which is a 1 (gamemaster) vs 3 (other players) deduction board game. Many answers and comments on those answers seem to be telling me that I'm guilty of playing a badwrongfun game, but the scenario I have described in my question is simply how some games work, and the need for decision certification doesn't go away because that scenario is unconventional.
– Bloodcinder
Nov 26 at 13:10
In fact, I'm playing with a group of close friends, and there's plenty of trust to go around. One can still desire a way to certify their own honesty even when one's honesty isn't suspect.
– Bloodcinder
Nov 26 at 13:15
Not that people should insinuate that you shouldn't play such a game regardless... But this really is why it helps to specify the game system you're playing in your post. Answers don't necessarily have to be specific to that one system, but at the least you'll ideally weed out the people providing answers that don't work in that system.
– V2Blast
2 days ago
3
3
As a useful practical example where the described scenario would crop up, combat in Mouse Guard (and presumably other Burning Wheel system games) is resolved with the GM and players each secretly deciding on three actions before revealing them all at once and resolving the round of combat
– Pingcode
Nov 23 at 8:48
As a useful practical example where the described scenario would crop up, combat in Mouse Guard (and presumably other Burning Wheel system games) is resolved with the GM and players each secretly deciding on three actions before revealing them all at once and resolving the round of combat
– Pingcode
Nov 23 at 8:48
3
3
@Pingcode That’s a great example too of a mechanic where even a trusted GM still should not be seeing the message ahead of time. (For the unfamiliar: Mouse Guard combat is centrally about attempting to predict the opposition’s secretly-recorded maneuvers, which makes it impossible to disregard knowing that information ahead of your own choices.) I wouldn’t want the additional burden of trying to ignore full knowledge while trying to play my side of MG’s fog-of-war combat fairly.
– SevenSidedDie♦
Nov 25 at 18:06
@Pingcode That’s a great example too of a mechanic where even a trusted GM still should not be seeing the message ahead of time. (For the unfamiliar: Mouse Guard combat is centrally about attempting to predict the opposition’s secretly-recorded maneuvers, which makes it impossible to disregard knowing that information ahead of your own choices.) I wouldn’t want the additional burden of trying to ignore full knowledge while trying to play my side of MG’s fog-of-war combat fairly.
– SevenSidedDie♦
Nov 25 at 18:06
1
1
I asked the question in a game-agnostic fashion because I wanted RPG.SE's expertise, but in full disclosure the game I'm playing is Tragedy Looper, which is a 1 (gamemaster) vs 3 (other players) deduction board game. Many answers and comments on those answers seem to be telling me that I'm guilty of playing a badwrongfun game, but the scenario I have described in my question is simply how some games work, and the need for decision certification doesn't go away because that scenario is unconventional.
– Bloodcinder
Nov 26 at 13:10
I asked the question in a game-agnostic fashion because I wanted RPG.SE's expertise, but in full disclosure the game I'm playing is Tragedy Looper, which is a 1 (gamemaster) vs 3 (other players) deduction board game. Many answers and comments on those answers seem to be telling me that I'm guilty of playing a badwrongfun game, but the scenario I have described in my question is simply how some games work, and the need for decision certification doesn't go away because that scenario is unconventional.
– Bloodcinder
Nov 26 at 13:10
In fact, I'm playing with a group of close friends, and there's plenty of trust to go around. One can still desire a way to certify their own honesty even when one's honesty isn't suspect.
– Bloodcinder
Nov 26 at 13:15
In fact, I'm playing with a group of close friends, and there's plenty of trust to go around. One can still desire a way to certify their own honesty even when one's honesty isn't suspect.
– Bloodcinder
Nov 26 at 13:15
Not that people should insinuate that you shouldn't play such a game regardless... But this really is why it helps to specify the game system you're playing in your post. Answers don't necessarily have to be specific to that one system, but at the least you'll ideally weed out the people providing answers that don't work in that system.
– V2Blast
2 days ago
Not that people should insinuate that you shouldn't play such a game regardless... But this really is why it helps to specify the game system you're playing in your post. Answers don't necessarily have to be specific to that one system, but at the least you'll ideally weed out the people providing answers that don't work in that system.
– V2Blast
2 days ago
add a comment |
9 Answers
9
active
oldest
votes
up vote
129
down vote
accepted
Have Alice generate and publish an SHA-256 hash of her action.
SHA-256 is a computationally-secure (to reasonable approximation) algorithm that converts a given string into an unintelligible hexadecimal hash. There are online implementations that will compute SHA256 for you, for instance, here.
The idea is this:
- Alice decides her action - say, "I cast Fireball at Bob"
- Alice privately records that exact text
- Alice enters that text into an SHA256 generator, producing a meaningless jumble of characters - A0FC4543FDBA266006F1F9FA818183710A8C5CA80613DA109B8A9DBA194DEC4E
- Alice publicly announces "I've planned an action; its SHA-256 is A0FC4543FDBA266006F1F9FA818183710A8C5CA80613DA109B8A9DBA194DEC4E"
Now, Bob cannot tell what Alice has planned because the SHA-256 is not reversible; there's no way to get from the hash back to the action.
Later, when Alice reveals her plan, she gives the exact text she prepared earlier. If Bob doesn't trust her, he can simply repeat the SHA-256 encryption, and verify that the signatures match.
If Alice suspects that Bob may guess her action, then she can make things harder by adding an extra, irrelevant component to the action before computing the SHA-256. For instance, if Alice records, signs, and later reveals "I cast Fireball at Bob (pistachio)", then Bob would not be able to guess and verify the action without also guessing the extra "(pistachio)". This is known as using a "nonce".
answered Nov 22 at 16:58
Chowlett
9961710
Comments are not for extended discussion; this conversation has been moved to chat.
– SevenSidedDie♦
Nov 23 at 15:48
1
If play by post refers to literal post, then this isn't a great answer. Typing a SHA into a computer from a piece of paper would be painful. If by e-mail, a password protected zip would be significantly faster and simpler.
– SLC
Nov 26 at 11:10
If playing by actual post, you wouldn't need to type the SHA in. Alice creates the SHA, adds it to her document, prints it out, mails it to Bob, who keeps it. Later, Alice declares what her action was, prints it out, mails it to Bob, who types the English text of the action into a SHA tool and verifies by sights that the hashes match.
– Chowlett
Nov 26 at 11:46
However, @SLC, a password-protected zip is an excellent idea. Why don't you add that as an answer yourself?
– Chowlett
Nov 26 at 11:47
Fair point. Someone already mentioned a zip further down in an answer so I didn't want to duplicate it, my comment was just to point out the difficulties of using a SHA. You've mitigated it somewhat but you'd have to type the message exactly for the SHA to match which could be tricky if it's a long amount of text and contains punctuation.
– SLC
Nov 26 at 14:01
add a comment |
up vote
12
down vote
Send the decisions to a trusted third party.
When the time comes to reveal the action, the third party will then do so.
This has the advantage of being simple and doesn't require any technological know-how.
answered Nov 22 at 17:43
Destruktor
2,7421649
5
It's not simple at all, as it adds an extra communication channel for every player in the game, and replaces technological know-how with social know-how instead, something that is far less reliable. These are disadvantages!
– Nij
Nov 22 at 19:27
2
This seems to count as "just relying on good faith."
– Bloodcinder
Nov 22 at 19:47
6
@Nij it is simple in the fact that a high percentage of people can actually accomplish this. The problem with bring encryption schemes, etc into the picture is that few non-technical people will understand how to deal with these things.
– Destruktor
Nov 23 at 5:43
1
@Bloodcinder: If you don't trust the GM, there are much bigger issues in your game.
– Matthieu M.
Nov 24 at 19:07
2
@MatthieuM. As addressed in comments on other answers, there are games in which the GM is also an adversarial player. In fact, in my situation, I am the GM and also an adversarial player and everyone does trust me, yet I still want a means of certifying my decisions.
– Bloodcinder
Nov 24 at 19:33
add a comment |
up vote
8
down vote
Use a communication system like facebook that allows you to set up visibility on each post.
Post a publicly visible post saying
Alice glances at her spell book then gestures, ready to begin casting a spell.
Post a private post saying
If X happens Alice will cast fireball at Y
If the trigger happens change the privacy of the post to public.
The timestamp and edit history should be able to show that the post has not been modified other than to change the visibility.
As V2Blast pointed out and Zac offered a solution to the public post should link to the private post to prove that it's the same post and you didn't post multiple hidden posts.
If you have a DM or similar in the game then you could also give them access to the private posts for their information.
answered Nov 22 at 20:45
Tim B
5,2361246
12
The potential issue with this is that you could just make multiple private posts with different courses of action, and just make public the one that you decide on after the fact.
– V2Blast
Nov 22 at 22:15
10
@V2Blast not if you provide a link to the (currently) private post in advance - if Facebook works correctly, it shouldn't reveal the post to others until it's made public, but the url won't change
– Zac Faragher
Nov 23 at 0:13
@ZacFaragher: Ah, interesting idea.
– V2Blast
Nov 23 at 2:49
add a comment |
up vote
7
down vote
A simple resource for exactly this kind of thing is http://onetimesecret.com. It allows you to create a "secret" and publish the link to it, but once the secret has been viewed once, it is deleted, and cannot be viewed again.
Alice enters her secret, and sends the hyperlink to Bob, but tells him not to look at it yet. Bob publicly declares his course of action, then looks at Alice's onetimesecret post. Alice can check the time at which her secret was viewed, to verify that it was after Bob's public declaration.
This way, Alice can't lie about her decision, but Bob won't know what it was until after he declares his course of action.
(Note: I am not affiliated in any way with onetimesecret.com. I just find it a useful resource.)
answered Nov 23 at 19:34
GentlePurpleRain
1712
New contributor
GentlePurpleRain is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
5
down vote
An alternative to hash commitment that requires less technical knowhow: do what scientists used to do to establish priority for an idea until they were ready to publish. Instead of a SHA, publish a signature that is easily derived from the message by a human but can't be easily reversed.
One simple "signature" is just to show how many times each letter appears in the message, but not their order. Then when it's time to reveal, it's easy to verify. So Alice can sign the message
I betray Bob
as
ABBBEIORTY
One obvious problem is that for such a short, straightforward message, Bob can probably guess what is meant: there are a lot of Bs and one O, so it's probably about him. He can also rule out some possibilities he's worried about: the message clearly can't include fireball, because there's no F; but it could include betray.
Alice can prevent this by speaking somewhat more cryptically or using a few more words than necessary. If Alice publishes
AAABDDDDEEEEEFGGGHHHHHHIIIIIILLLLMMNOOOOOORRRRRSSTTTTTTTUUUWW
it's hard to guess that she means
Though allied with Robert, I grow tired of him and sell him out to the guards.
Just for fun, note that this message does leave open the possibility of a fireball (because it contains all of the letters in "FIREBALL"), in case Alice thinks that's something Bob would want to rule out.
edited Nov 23 at 15:52
Ben Bolker
1033
answered Nov 22 at 23:07
amalloy
1694
9
This is essentially re-implementing cryptography, except without tooling or the security. If Alice is good with words, she can with relative ease craft 2, or more, sentences using exactly the same set of letters, and decide on the fly which to "reveal".
– Matthieu M.
Nov 24 at 19:09
2
The answer could be improved by noting something about its practical application: How big can the phrase get before you’ve found this to be unwieldy during games?
– SevenSidedDie♦
Nov 25 at 18:00
This simplistic 'hash' also comes with the downside of not having any tool support... while googling "SHA generator" will yield hundreds of results all readily available in your browser.
– fgysin
2 days ago
add a comment |
up vote
4
down vote
Trust
This one isn't always appropriate - but if you play with a constant group of friends, then simply trusting that they are being honest is the way I usually play games. This works for me, because I don't generally play with randoms or at events outside of home.
Obviously this won't always work - not everyone has the required integrity to resist the urge to cheat. But if you're playing a longer campaign with a consistent group, you'll learn pretty quickly using this method whether it's actually viable.
If not, then the other methods mentioned above are steller. However, as far as simplicity and ease to implement is concerned, this is by far the easiest.
answered Nov 22 at 23:37
Shadow
396112
add a comment |
up vote
4
down vote
I agree that some sort of cryptography is the best, but I also understand that this could be daunting for people who are not much into tech.
Here is a (hopefully) simpler way to accomplish the same.
I write a short note describing my decision.
Zip it WITH A PASSWORD (see https://community.sophos.com/kb/en-us/11489) and send the zipped file as an attachment to my email to each and every other participant.
When it is time to reveal my decision, I send out the pwd. Everyone can unzip and read what I wrote.
Note: if this is a common practice (i.e. everyone has to send out lots of "secret" messages) you better do some bookkeeping. I.e. prepare a spreadsheet or a note where you write the pwd and a short description (or maybe just date) of the encrypted message.
So whe it is time to reveal "what did you do while alone in the purple cavern" or "what was in the note you sent out on May 15th" you can go check your list and provide the appropriate pwd.
answered Nov 26 at 8:24
p.marino
2,8301419
add a comment |
up vote
2
down vote
This problem was already solved in the past. As exibit A, I would introduce the game "Diplomacy" which had a prolific history of play by post. In this game, 7 players needs to coordinate (and betray) each other constantly to progress the game. There are of course direct communications between players, but any move must be committed and sent to a third party "referee". The referee would receive the moves, execute and resolve them appropriately, and then publish the outcome in a public channel (usually, a magazine, plus direct paper mail to each player.)
The only requirement here is trust with the game organizer. But why would you play if you can't trust at least the organizer?
answered Nov 23 at 9:04
STT LCU
421417
1
"... why would you play if you can't trust at least the organizer?" - probably because they don't have an external organizer, and players run it collectively.
– Nij
Nov 23 at 21:28
2
In my particular game, the gamemaster is also an adversarial player. This solution expects that the GM can be trusted on good faith, but that violates the premise of the question.
– Bloodcinder
Nov 23 at 23:35
1
@bloodcinder no it does not, he doesn’t say the player/GM has to be the organizer/referee.
– mxyzplk♦
Nov 24 at 5:46
1
The question completely forbids good faith as a helpful solution, regardless of how pedantic you get about the name for who is trusted.
– Bloodcinder
Nov 24 at 15:09
@Bloodcinder I wouldn't play under these circumstances. But I'm quite peculiar, I very rarely (if ever) play with only complete strangers.
– STT LCU
Nov 26 at 8:22
|
show 4 more comments
up vote
-3
down vote
Alice make decision message -> [D]
Encrypt [D] with random private key [PK], make cryptogram -> [C]
Lots of algorithms can be used here.
Send [C] to Bob.
When event have to occur, Bob request [PK] from Alice.
Alice Send [PK], Bob can translate [C]->[D]
it is hard to make [C] to desired other decision message[D2] with other [PK2]
Show programmer in your team this sequence. He will understand if he have learn.
edited Nov 23 at 2:51
V2Blast
18.2k248114
answered Nov 23 at 2:01
siamenock
131
New contributor
siamenock is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
6
And if there's no programmer available, how does this help anybody? The answer seems to be a much worse version of the answer posted by Chowlett hours ago.
– Nij
Nov 23 at 2:46
1
There are existing tools for this. Which one did you use when you played this kind of game?
– SevenSidedDie♦
Nov 23 at 15:39
add a comment |
9 Answers
9
active
oldest
votes
9 Answers
9
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
129
down vote
accepted
Have Alice generate and publish an SHA-256 hash of her action.
SHA-256 is a computationally-secure (to reasonable approximation) algorithm that converts a given string into an unintelligible hexadecimal hash. There are online implementations that will compute SHA256 for you, for instance, here.
The idea is this:
- Alice decides her action - say, "I cast Fireball at Bob"
- Alice privately records that exact text
- Alice enters that text into an SHA256 generator, producing a meaningless jumble of characters - A0FC4543FDBA266006F1F9FA818183710A8C5CA80613DA109B8A9DBA194DEC4E
- Alice publicly announces "I've planned an action; its SHA-256 is A0FC4543FDBA266006F1F9FA818183710A8C5CA80613DA109B8A9DBA194DEC4E"
Now, Bob cannot tell what Alice has planned because the SHA-256 is not reversible; there's no way to get from the hash back to the action.
Later, when Alice reveals her plan, she gives the exact text she prepared earlier. If Bob doesn't trust her, he can simply repeat the SHA-256 encryption, and verify that the signatures match.
If Alice suspects that Bob may guess her action, then she can make things harder by adding an extra, irrelevant component to the action before computing the SHA-256. For instance, if Alice records, signs, and later reveals "I cast Fireball at Bob (pistachio)", then Bob would not be able to guess and verify the action without also guessing the extra "(pistachio)". This is known as using a "nonce".
answered Nov 22 at 16:58
Chowlett
9961710
Comments are not for extended discussion; this conversation has been moved to chat.
– SevenSidedDie♦
Nov 23 at 15:48
1
If play by post refers to literal post, then this isn't a great answer. Typing a SHA into a computer from a piece of paper would be painful. If by e-mail, a password protected zip would be significantly faster and simpler.
– SLC
Nov 26 at 11:10
If playing by actual post, you wouldn't need to type the SHA in. Alice creates the SHA, adds it to her document, prints it out, mails it to Bob, who keeps it. Later, Alice declares what her action was, prints it out, mails it to Bob, who types the English text of the action into a SHA tool and verifies by sights that the hashes match.
– Chowlett
Nov 26 at 11:46
However, @SLC, a password-protected zip is an excellent idea. Why don't you add that as an answer yourself?
– Chowlett
Nov 26 at 11:47
Fair point. Someone already mentioned a zip further down in an answer so I didn't want to duplicate it, my comment was just to point out the difficulties of using a SHA. You've mitigated it somewhat but you'd have to type the message exactly for the SHA to match which could be tricky if it's a long amount of text and contains punctuation.
– SLC
Nov 26 at 14:01
add a comment |
up vote
129
down vote
accepted
Have Alice generate and publish an SHA-256 hash of her action.
SHA-256 is a computationally-secure (to reasonable approximation) algorithm that converts a given string into an unintelligible hexadecimal hash. There are online implementations that will compute SHA256 for you, for instance, here.
The idea is this:
- Alice decides her action - say, "I cast Fireball at Bob"
- Alice privately records that exact text
- Alice enters that text into an SHA256 generator, producing a meaningless jumble of characters - A0FC4543FDBA266006F1F9FA818183710A8C5CA80613DA109B8A9DBA194DEC4E
- Alice publicly announces "I've planned an action; its SHA-256 is A0FC4543FDBA266006F1F9FA818183710A8C5CA80613DA109B8A9DBA194DEC4E"
Now, Bob cannot tell what Alice has planned because the SHA-256 is not reversible; there's no way to get from the hash back to the action.
Later, when Alice reveals her plan, she gives the exact text she prepared earlier. If Bob doesn't trust her, he can simply repeat the SHA-256 encryption, and verify that the signatures match.
If Alice suspects that Bob may guess her action, then she can make things harder by adding an extra, irrelevant component to the action before computing the SHA-256. For instance, if Alice records, signs, and later reveals "I cast Fireball at Bob (pistachio)", then Bob would not be able to guess and verify the action without also guessing the extra "(pistachio)". This is known as using a "nonce".
answered Nov 22 at 16:58
Chowlett
9961710
Comments are not for extended discussion; this conversation has been moved to chat.
– SevenSidedDie♦
Nov 23 at 15:48
1
If play by post refers to literal post, then this isn't a great answer. Typing a SHA into a computer from a piece of paper would be painful. If by e-mail, a password protected zip would be significantly faster and simpler.
– SLC
Nov 26 at 11:10
If playing by actual post, you wouldn't need to type the SHA in. Alice creates the SHA, adds it to her document, prints it out, mails it to Bob, who keeps it. Later, Alice declares what her action was, prints it out, mails it to Bob, who types the English text of the action into a SHA tool and verifies by sights that the hashes match.
– Chowlett
Nov 26 at 11:46
However, @SLC, a password-protected zip is an excellent idea. Why don't you add that as an answer yourself?
– Chowlett
Nov 26 at 11:47
Fair point. Someone already mentioned a zip further down in an answer so I didn't want to duplicate it, my comment was just to point out the difficulties of using a SHA. You've mitigated it somewhat but you'd have to type the message exactly for the SHA to match which could be tricky if it's a long amount of text and contains punctuation.
– SLC
Nov 26 at 14:01
add a comment |
up vote
129
down vote
accepted
up vote
129
down vote
accepted
Have Alice generate and publish an SHA-256 hash of her action.
SHA-256 is a computationally-secure (to reasonable approximation) algorithm that converts a given string into an unintelligible hexadecimal hash. There are online implementations that will compute SHA256 for you, for instance, here.
The idea is this:
- Alice decides her action - say, "I cast Fireball at Bob"
- Alice privately records that exact text
- Alice enters that text into an SHA256 generator, producing a meaningless jumble of characters - A0FC4543FDBA266006F1F9FA818183710A8C5CA80613DA109B8A9DBA194DEC4E
- Alice publicly announces "I've planned an action; its SHA-256 is A0FC4543FDBA266006F1F9FA818183710A8C5CA80613DA109B8A9DBA194DEC4E"
Now, Bob cannot tell what Alice has planned because the SHA-256 is not reversible; there's no way to get from the hash back to the action.
Later, when Alice reveals her plan, she gives the exact text she prepared earlier. If Bob doesn't trust her, he can simply repeat the SHA-256 encryption, and verify that the signatures match.
If Alice suspects that Bob may guess her action, then she can make things harder by adding an extra, irrelevant component to the action before computing the SHA-256. For instance, if Alice records, signs, and later reveals "I cast Fireball at Bob (pistachio)", then Bob would not be able to guess and verify the action without also guessing the extra "(pistachio)". This is known as using a "nonce".
answered Nov 22 at 16:58
Chowlett
9961710
Have Alice generate and publish an SHA-256 hash of her action.
SHA-256 is a computationally-secure (to reasonable approximation) algorithm that converts a given string into an unintelligible hexadecimal hash. There are online implementations that will compute SHA256 for you, for instance, here.
The idea is this:
- Alice decides her action - say, "I cast Fireball at Bob"
- Alice privately records that exact text
- Alice enters that text into an SHA256 generator, producing a meaningless jumble of characters - A0FC4543FDBA266006F1F9FA818183710A8C5CA80613DA109B8A9DBA194DEC4E
- Alice publicly announces "I've planned an action; its SHA-256 is A0FC4543FDBA266006F1F9FA818183710A8C5CA80613DA109B8A9DBA194DEC4E"
Now, Bob cannot tell what Alice has planned because the SHA-256 is not reversible; there's no way to get from the hash back to the action.
Later, when Alice reveals her plan, she gives the exact text she prepared earlier. If Bob doesn't trust her, he can simply repeat the SHA-256 encryption, and verify that the signatures match.
If Alice suspects that Bob may guess her action, then she can make things harder by adding an extra, irrelevant component to the action before computing the SHA-256. For instance, if Alice records, signs, and later reveals "I cast Fireball at Bob (pistachio)", then Bob would not be able to guess and verify the action without also guessing the extra "(pistachio)". This is known as using a "nonce".
answered Nov 22 at 16:58
Chowlett
9961710
edited Nov 25 at 14:48
answered Nov 22 at 16:58
Chowlett
9961710
answered Nov 22 at 16:58
Chowlett
9961710
answered Nov 22 at 16:58
Chowlett
9961710
9961710
Comments are not for extended discussion; this conversation has been moved to chat.
– SevenSidedDie♦
Nov 23 at 15:48
1
If play by post refers to literal post, then this isn't a great answer. Typing a SHA into a computer from a piece of paper would be painful. If by e-mail, a password protected zip would be significantly faster and simpler.
– SLC
Nov 26 at 11:10
If playing by actual post, you wouldn't need to type the SHA in. Alice creates the SHA, adds it to her document, prints it out, mails it to Bob, who keeps it. Later, Alice declares what her action was, prints it out, mails it to Bob, who types the English text of the action into a SHA tool and verifies by sights that the hashes match.
– Chowlett
Nov 26 at 11:46
However, @SLC, a password-protected zip is an excellent idea. Why don't you add that as an answer yourself?
– Chowlett
Nov 26 at 11:47
Fair point. Someone already mentioned a zip further down in an answer so I didn't want to duplicate it, my comment was just to point out the difficulties of using a SHA. You've mitigated it somewhat but you'd have to type the message exactly for the SHA to match which could be tricky if it's a long amount of text and contains punctuation.
– SLC
Nov 26 at 14:01
add a comment |
Comments are not for extended discussion; this conversation has been moved to chat.
– SevenSidedDie♦
Nov 23 at 15:48
1
If play by post refers to literal post, then this isn't a great answer. Typing a SHA into a computer from a piece of paper would be painful. If by e-mail, a password protected zip would be significantly faster and simpler.
– SLC
Nov 26 at 11:10
If playing by actual post, you wouldn't need to type the SHA in. Alice creates the SHA, adds it to her document, prints it out, mails it to Bob, who keeps it. Later, Alice declares what her action was, prints it out, mails it to Bob, who types the English text of the action into a SHA tool and verifies by sights that the hashes match.
– Chowlett
Nov 26 at 11:46
However, @SLC, a password-protected zip is an excellent idea. Why don't you add that as an answer yourself?
– Chowlett
Nov 26 at 11:47
Fair point. Someone already mentioned a zip further down in an answer so I didn't want to duplicate it, my comment was just to point out the difficulties of using a SHA. You've mitigated it somewhat but you'd have to type the message exactly for the SHA to match which could be tricky if it's a long amount of text and contains punctuation.
– SLC
Nov 26 at 14:01
Comments are not for extended discussion; this conversation has been moved to chat.
– SevenSidedDie♦
Nov 23 at 15:48
Comments are not for extended discussion; this conversation has been moved to chat.
– SevenSidedDie♦
Nov 23 at 15:48
1
1
If play by post refers to literal post, then this isn't a great answer. Typing a SHA into a computer from a piece of paper would be painful. If by e-mail, a password protected zip would be significantly faster and simpler.
– SLC
Nov 26 at 11:10
If play by post refers to literal post, then this isn't a great answer. Typing a SHA into a computer from a piece of paper would be painful. If by e-mail, a password protected zip would be significantly faster and simpler.
– SLC
Nov 26 at 11:10
If playing by actual post, you wouldn't need to type the SHA in. Alice creates the SHA, adds it to her document, prints it out, mails it to Bob, who keeps it. Later, Alice declares what her action was, prints it out, mails it to Bob, who types the English text of the action into a SHA tool and verifies by sights that the hashes match.
– Chowlett
Nov 26 at 11:46
If playing by actual post, you wouldn't need to type the SHA in. Alice creates the SHA, adds it to her document, prints it out, mails it to Bob, who keeps it. Later, Alice declares what her action was, prints it out, mails it to Bob, who types the English text of the action into a SHA tool and verifies by sights that the hashes match.
– Chowlett
Nov 26 at 11:46
However, @SLC, a password-protected zip is an excellent idea. Why don't you add that as an answer yourself?
– Chowlett
Nov 26 at 11:47
However, @SLC, a password-protected zip is an excellent idea. Why don't you add that as an answer yourself?
– Chowlett
Nov 26 at 11:47
Fair point. Someone already mentioned a zip further down in an answer so I didn't want to duplicate it, my comment was just to point out the difficulties of using a SHA. You've mitigated it somewhat but you'd have to type the message exactly for the SHA to match which could be tricky if it's a long amount of text and contains punctuation.
– SLC
Nov 26 at 14:01
Fair point. Someone already mentioned a zip further down in an answer so I didn't want to duplicate it, my comment was just to point out the difficulties of using a SHA. You've mitigated it somewhat but you'd have to type the message exactly for the SHA to match which could be tricky if it's a long amount of text and contains punctuation.
– SLC
Nov 26 at 14:01
add a comment |
up vote
12
down vote
Send the decisions to a trusted third party.
When the time comes to reveal the action, the third party will then do so.
This has the advantage of being simple and doesn't require any technological know-how.
answered Nov 22 at 17:43
Destruktor
2,7421649
5
It's not simple at all, as it adds an extra communication channel for every player in the game, and replaces technological know-how with social know-how instead, something that is far less reliable. These are disadvantages!
– Nij
Nov 22 at 19:27
2
This seems to count as "just relying on good faith."
– Bloodcinder
Nov 22 at 19:47
6
@Nij it is simple in the fact that a high percentage of people can actually accomplish this. The problem with bring encryption schemes, etc into the picture is that few non-technical people will understand how to deal with these things.
– Destruktor
Nov 23 at 5:43
1
@Bloodcinder: If you don't trust the GM, there are much bigger issues in your game.
– Matthieu M.
Nov 24 at 19:07
2
@MatthieuM. As addressed in comments on other answers, there are games in which the GM is also an adversarial player. In fact, in my situation, I am the GM and also an adversarial player and everyone does trust me, yet I still want a means of certifying my decisions.
– Bloodcinder
Nov 24 at 19:33
add a comment |
up vote
12
down vote
Send the decisions to a trusted third party.
When the time comes to reveal the action, the third party will then do so.
This has the advantage of being simple and doesn't require any technological know-how.
answered Nov 22 at 17:43
Destruktor
2,7421649
5
It's not simple at all, as it adds an extra communication channel for every player in the game, and replaces technological know-how with social know-how instead, something that is far less reliable. These are disadvantages!
– Nij
Nov 22 at 19:27
2
This seems to count as "just relying on good faith."
– Bloodcinder
Nov 22 at 19:47
6
@Nij it is simple in the fact that a high percentage of people can actually accomplish this. The problem with bring encryption schemes, etc into the picture is that few non-technical people will understand how to deal with these things.
– Destruktor
Nov 23 at 5:43
1
@Bloodcinder: If you don't trust the GM, there are much bigger issues in your game.
– Matthieu M.
Nov 24 at 19:07
2
@MatthieuM. As addressed in comments on other answers, there are games in which the GM is also an adversarial player. In fact, in my situation, I am the GM and also an adversarial player and everyone does trust me, yet I still want a means of certifying my decisions.
– Bloodcinder
Nov 24 at 19:33
add a comment |
up vote
12
down vote
up vote
12
down vote
Send the decisions to a trusted third party.
When the time comes to reveal the action, the third party will then do so.
This has the advantage of being simple and doesn't require any technological know-how.
answered Nov 22 at 17:43
Destruktor
2,7421649
Send the decisions to a trusted third party.
When the time comes to reveal the action, the third party will then do so.
This has the advantage of being simple and doesn't require any technological know-how.
answered Nov 22 at 17:43
Destruktor
2,7421649
answered Nov 22 at 17:43
Destruktor
2,7421649
answered Nov 22 at 17:43
Destruktor
2,7421649
answered Nov 22 at 17:43
Destruktor
2,7421649
2,7421649
5
It's not simple at all, as it adds an extra communication channel for every player in the game, and replaces technological know-how with social know-how instead, something that is far less reliable. These are disadvantages!
– Nij
Nov 22 at 19:27
2
This seems to count as "just relying on good faith."
– Bloodcinder
Nov 22 at 19:47
6
@Nij it is simple in the fact that a high percentage of people can actually accomplish this. The problem with bring encryption schemes, etc into the picture is that few non-technical people will understand how to deal with these things.
– Destruktor
Nov 23 at 5:43
1
@Bloodcinder: If you don't trust the GM, there are much bigger issues in your game.
– Matthieu M.
Nov 24 at 19:07
2
@MatthieuM. As addressed in comments on other answers, there are games in which the GM is also an adversarial player. In fact, in my situation, I am the GM and also an adversarial player and everyone does trust me, yet I still want a means of certifying my decisions.
– Bloodcinder
Nov 24 at 19:33
add a comment |
5
It's not simple at all, as it adds an extra communication channel for every player in the game, and replaces technological know-how with social know-how instead, something that is far less reliable. These are disadvantages!
– Nij
Nov 22 at 19:27
2
This seems to count as "just relying on good faith."
– Bloodcinder
Nov 22 at 19:47
6
@Nij it is simple in the fact that a high percentage of people can actually accomplish this. The problem with bring encryption schemes, etc into the picture is that few non-technical people will understand how to deal with these things.
– Destruktor
Nov 23 at 5:43
1
@Bloodcinder: If you don't trust the GM, there are much bigger issues in your game.
– Matthieu M.
Nov 24 at 19:07
2
@MatthieuM. As addressed in comments on other answers, there are games in which the GM is also an adversarial player. In fact, in my situation, I am the GM and also an adversarial player and everyone does trust me, yet I still want a means of certifying my decisions.
– Bloodcinder
Nov 24 at 19:33
5
5
It's not simple at all, as it adds an extra communication channel for every player in the game, and replaces technological know-how with social know-how instead, something that is far less reliable. These are disadvantages!
– Nij
Nov 22 at 19:27
It's not simple at all, as it adds an extra communication channel for every player in the game, and replaces technological know-how with social know-how instead, something that is far less reliable. These are disadvantages!
– Nij
Nov 22 at 19:27
2
2
This seems to count as "just relying on good faith."
– Bloodcinder
Nov 22 at 19:47
This seems to count as "just relying on good faith."
– Bloodcinder
Nov 22 at 19:47
6
6
@Nij it is simple in the fact that a high percentage of people can actually accomplish this. The problem with bring encryption schemes, etc into the picture is that few non-technical people will understand how to deal with these things.
– Destruktor
Nov 23 at 5:43
@Nij it is simple in the fact that a high percentage of people can actually accomplish this. The problem with bring encryption schemes, etc into the picture is that few non-technical people will understand how to deal with these things.
– Destruktor
Nov 23 at 5:43
1
1
@Bloodcinder: If you don't trust the GM, there are much bigger issues in your game.
– Matthieu M.
Nov 24 at 19:07
@Bloodcinder: If you don't trust the GM, there are much bigger issues in your game.
– Matthieu M.
Nov 24 at 19:07
2
2
@MatthieuM. As addressed in comments on other answers, there are games in which the GM is also an adversarial player. In fact, in my situation, I am the GM and also an adversarial player and everyone does trust me, yet I still want a means of certifying my decisions.
– Bloodcinder
Nov 24 at 19:33
@MatthieuM. As addressed in comments on other answers, there are games in which the GM is also an adversarial player. In fact, in my situation, I am the GM and also an adversarial player and everyone does trust me, yet I still want a means of certifying my decisions.
– Bloodcinder
Nov 24 at 19:33
add a comment |
up vote
8
down vote
Use a communication system like facebook that allows you to set up visibility on each post.
Post a publicly visible post saying
Alice glances at her spell book then gestures, ready to begin casting a spell.
Post a private post saying
If X happens Alice will cast fireball at Y
If the trigger happens change the privacy of the post to public.
The timestamp and edit history should be able to show that the post has not been modified other than to change the visibility.
As V2Blast pointed out and Zac offered a solution to the public post should link to the private post to prove that it's the same post and you didn't post multiple hidden posts.
If you have a DM or similar in the game then you could also give them access to the private posts for their information.
answered Nov 22 at 20:45
Tim B
5,2361246
12
The potential issue with this is that you could just make multiple private posts with different courses of action, and just make public the one that you decide on after the fact.
– V2Blast
Nov 22 at 22:15
10
@V2Blast not if you provide a link to the (currently) private post in advance - if Facebook works correctly, it shouldn't reveal the post to others until it's made public, but the url won't change
– Zac Faragher
Nov 23 at 0:13
@ZacFaragher: Ah, interesting idea.
– V2Blast
Nov 23 at 2:49
add a comment |
up vote
8
down vote
Use a communication system like facebook that allows you to set up visibility on each post.
Post a publicly visible post saying
Alice glances at her spell book then gestures, ready to begin casting a spell.
Post a private post saying
If X happens Alice will cast fireball at Y
If the trigger happens change the privacy of the post to public.
The timestamp and edit history should be able to show that the post has not been modified other than to change the visibility.
As V2Blast pointed out and Zac offered a solution to the public post should link to the private post to prove that it's the same post and you didn't post multiple hidden posts.
If you have a DM or similar in the game then you could also give them access to the private posts for their information.
answered Nov 22 at 20:45
Tim B
5,2361246
12
The potential issue with this is that you could just make multiple private posts with different courses of action, and just make public the one that you decide on after the fact.
– V2Blast
Nov 22 at 22:15
10
@V2Blast not if you provide a link to the (currently) private post in advance - if Facebook works correctly, it shouldn't reveal the post to others until it's made public, but the url won't change
– Zac Faragher
Nov 23 at 0:13
@ZacFaragher: Ah, interesting idea.
– V2Blast
Nov 23 at 2:49
add a comment |
up vote
8
down vote
up vote
8
down vote
Use a communication system like facebook that allows you to set up visibility on each post.
Post a publicly visible post saying
Alice glances at her spell book then gestures, ready to begin casting a spell.
Post a private post saying
If X happens Alice will cast fireball at Y
If the trigger happens change the privacy of the post to public.
The timestamp and edit history should be able to show that the post has not been modified other than to change the visibility.
As V2Blast pointed out and Zac offered a solution to the public post should link to the private post to prove that it's the same post and you didn't post multiple hidden posts.
If you have a DM or similar in the game then you could also give them access to the private posts for their information.
answered Nov 22 at 20:45
Tim B
5,2361246
Use a communication system like facebook that allows you to set up visibility on each post.
Post a publicly visible post saying
Alice glances at her spell book then gestures, ready to begin casting a spell.
Post a private post saying
If X happens Alice will cast fireball at Y
If the trigger happens change the privacy of the post to public.
The timestamp and edit history should be able to show that the post has not been modified other than to change the visibility.
As V2Blast pointed out and Zac offered a solution to the public post should link to the private post to prove that it's the same post and you didn't post multiple hidden posts.
If you have a DM or similar in the game then you could also give them access to the private posts for their information.
answered Nov 22 at 20:45
Tim B
5,2361246
edited Nov 23 at 9:28
answered Nov 22 at 20:45
Tim B
5,2361246
answered Nov 22 at 20:45
Tim B
5,2361246
answered Nov 22 at 20:45
Tim B
5,2361246
5,2361246
12
The potential issue with this is that you could just make multiple private posts with different courses of action, and just make public the one that you decide on after the fact.
– V2Blast
Nov 22 at 22:15
10
@V2Blast not if you provide a link to the (currently) private post in advance - if Facebook works correctly, it shouldn't reveal the post to others until it's made public, but the url won't change
– Zac Faragher
Nov 23 at 0:13
@ZacFaragher: Ah, interesting idea.
– V2Blast
Nov 23 at 2:49
add a comment |
12
The potential issue with this is that you could just make multiple private posts with different courses of action, and just make public the one that you decide on after the fact.
– V2Blast
Nov 22 at 22:15
10
@V2Blast not if you provide a link to the (currently) private post in advance - if Facebook works correctly, it shouldn't reveal the post to others until it's made public, but the url won't change
– Zac Faragher
Nov 23 at 0:13
@ZacFaragher: Ah, interesting idea.
– V2Blast
Nov 23 at 2:49
12
12
The potential issue with this is that you could just make multiple private posts with different courses of action, and just make public the one that you decide on after the fact.
– V2Blast
Nov 22 at 22:15
The potential issue with this is that you could just make multiple private posts with different courses of action, and just make public the one that you decide on after the fact.
– V2Blast
Nov 22 at 22:15
10
10
@V2Blast not if you provide a link to the (currently) private post in advance - if Facebook works correctly, it shouldn't reveal the post to others until it's made public, but the url won't change
– Zac Faragher
Nov 23 at 0:13
@V2Blast not if you provide a link to the (currently) private post in advance - if Facebook works correctly, it shouldn't reveal the post to others until it's made public, but the url won't change
– Zac Faragher
Nov 23 at 0:13
@ZacFaragher: Ah, interesting idea.
– V2Blast
Nov 23 at 2:49
@ZacFaragher: Ah, interesting idea.
– V2Blast
Nov 23 at 2:49
add a comment |
up vote
7
down vote
A simple resource for exactly this kind of thing is http://onetimesecret.com. It allows you to create a "secret" and publish the link to it, but once the secret has been viewed once, it is deleted, and cannot be viewed again.
Alice enters her secret, and sends the hyperlink to Bob, but tells him not to look at it yet. Bob publicly declares his course of action, then looks at Alice's onetimesecret post. Alice can check the time at which her secret was viewed, to verify that it was after Bob's public declaration.
This way, Alice can't lie about her decision, but Bob won't know what it was until after he declares his course of action.
(Note: I am not affiliated in any way with onetimesecret.com. I just find it a useful resource.)
answered Nov 23 at 19:34
GentlePurpleRain
1712
New contributor
GentlePurpleRain is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
7
down vote
A simple resource for exactly this kind of thing is http://onetimesecret.com. It allows you to create a "secret" and publish the link to it, but once the secret has been viewed once, it is deleted, and cannot be viewed again.
Alice enters her secret, and sends the hyperlink to Bob, but tells him not to look at it yet. Bob publicly declares his course of action, then looks at Alice's onetimesecret post. Alice can check the time at which her secret was viewed, to verify that it was after Bob's public declaration.
This way, Alice can't lie about her decision, but Bob won't know what it was until after he declares his course of action.
(Note: I am not affiliated in any way with onetimesecret.com. I just find it a useful resource.)
answered Nov 23 at 19:34
GentlePurpleRain
1712
New contributor
GentlePurpleRain is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
up vote
7
down vote
up vote
7
down vote
A simple resource for exactly this kind of thing is http://onetimesecret.com. It allows you to create a "secret" and publish the link to it, but once the secret has been viewed once, it is deleted, and cannot be viewed again.
Alice enters her secret, and sends the hyperlink to Bob, but tells him not to look at it yet. Bob publicly declares his course of action, then looks at Alice's onetimesecret post. Alice can check the time at which her secret was viewed, to verify that it was after Bob's public declaration.
This way, Alice can't lie about her decision, but Bob won't know what it was until after he declares his course of action.
(Note: I am not affiliated in any way with onetimesecret.com. I just find it a useful resource.)
answered Nov 23 at 19:34
GentlePurpleRain
1712
New contributor
GentlePurpleRain is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
A simple resource for exactly this kind of thing is http://onetimesecret.com. It allows you to create a "secret" and publish the link to it, but once the secret has been viewed once, it is deleted, and cannot be viewed again.
Alice enters her secret, and sends the hyperlink to Bob, but tells him not to look at it yet. Bob publicly declares his course of action, then looks at Alice's onetimesecret post. Alice can check the time at which her secret was viewed, to verify that it was after Bob's public declaration.
This way, Alice can't lie about her decision, but Bob won't know what it was until after he declares his course of action.
(Note: I am not affiliated in any way with onetimesecret.com. I just find it a useful resource.)
answered Nov 23 at 19:34
GentlePurpleRain
1712
New contributor
GentlePurpleRain is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered Nov 23 at 19:34
GentlePurpleRain
1712
New contributor
GentlePurpleRain is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered Nov 23 at 19:34
GentlePurpleRain
1712
answered Nov 23 at 19:34
GentlePurpleRain
1712
1712
New contributor
GentlePurpleRain is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
GentlePurpleRain is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
GentlePurpleRain is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
up vote
5
down vote
An alternative to hash commitment that requires less technical knowhow: do what scientists used to do to establish priority for an idea until they were ready to publish. Instead of a SHA, publish a signature that is easily derived from the message by a human but can't be easily reversed.
One simple "signature" is just to show how many times each letter appears in the message, but not their order. Then when it's time to reveal, it's easy to verify. So Alice can sign the message
I betray Bob
as
ABBBEIORTY
One obvious problem is that for such a short, straightforward message, Bob can probably guess what is meant: there are a lot of Bs and one O, so it's probably about him. He can also rule out some possibilities he's worried about: the message clearly can't include fireball, because there's no F; but it could include betray.
Alice can prevent this by speaking somewhat more cryptically or using a few more words than necessary. If Alice publishes
AAABDDDDEEEEEFGGGHHHHHHIIIIIILLLLMMNOOOOOORRRRRSSTTTTTTTUUUWW
it's hard to guess that she means
Though allied with Robert, I grow tired of him and sell him out to the guards.
Just for fun, note that this message does leave open the possibility of a fireball (because it contains all of the letters in "FIREBALL"), in case Alice thinks that's something Bob would want to rule out.
edited Nov 23 at 15:52
Ben Bolker
1033
answered Nov 22 at 23:07
amalloy
1694
9
This is essentially re-implementing cryptography, except without tooling or the security. If Alice is good with words, she can with relative ease craft 2, or more, sentences using exactly the same set of letters, and decide on the fly which to "reveal".
– Matthieu M.
Nov 24 at 19:09
2
The answer could be improved by noting something about its practical application: How big can the phrase get before you’ve found this to be unwieldy during games?
– SevenSidedDie♦
Nov 25 at 18:00
This simplistic 'hash' also comes with the downside of not having any tool support... while googling "SHA generator" will yield hundreds of results all readily available in your browser.
– fgysin
2 days ago
add a comment |
up vote
5
down vote
An alternative to hash commitment that requires less technical knowhow: do what scientists used to do to establish priority for an idea until they were ready to publish. Instead of a SHA, publish a signature that is easily derived from the message by a human but can't be easily reversed.
One simple "signature" is just to show how many times each letter appears in the message, but not their order. Then when it's time to reveal, it's easy to verify. So Alice can sign the message
I betray Bob
as
ABBBEIORTY
One obvious problem is that for such a short, straightforward message, Bob can probably guess what is meant: there are a lot of Bs and one O, so it's probably about him. He can also rule out some possibilities he's worried about: the message clearly can't include fireball, because there's no F; but it could include betray.
Alice can prevent this by speaking somewhat more cryptically or using a few more words than necessary. If Alice publishes
AAABDDDDEEEEEFGGGHHHHHHIIIIIILLLLMMNOOOOOORRRRRSSTTTTTTTUUUWW
it's hard to guess that she means
Though allied with Robert, I grow tired of him and sell him out to the guards.
Just for fun, note that this message does leave open the possibility of a fireball (because it contains all of the letters in "FIREBALL"), in case Alice thinks that's something Bob would want to rule out.
edited Nov 23 at 15:52
Ben Bolker
1033
answered Nov 22 at 23:07
amalloy
1694
9
This is essentially re-implementing cryptography, except without tooling or the security. If Alice is good with words, she can with relative ease craft 2, or more, sentences using exactly the same set of letters, and decide on the fly which to "reveal".
– Matthieu M.
Nov 24 at 19:09
2
The answer could be improved by noting something about its practical application: How big can the phrase get before you’ve found this to be unwieldy during games?
– SevenSidedDie♦
Nov 25 at 18:00
This simplistic 'hash' also comes with the downside of not having any tool support... while googling "SHA generator" will yield hundreds of results all readily available in your browser.
– fgysin
2 days ago
add a comment |
up vote
5
down vote
up vote
5
down vote
An alternative to hash commitment that requires less technical knowhow: do what scientists used to do to establish priority for an idea until they were ready to publish. Instead of a SHA, publish a signature that is easily derived from the message by a human but can't be easily reversed.
One simple "signature" is just to show how many times each letter appears in the message, but not their order. Then when it's time to reveal, it's easy to verify. So Alice can sign the message
I betray Bob
as
ABBBEIORTY
One obvious problem is that for such a short, straightforward message, Bob can probably guess what is meant: there are a lot of Bs and one O, so it's probably about him. He can also rule out some possibilities he's worried about: the message clearly can't include fireball, because there's no F; but it could include betray.
Alice can prevent this by speaking somewhat more cryptically or using a few more words than necessary. If Alice publishes
AAABDDDDEEEEEFGGGHHHHHHIIIIIILLLLMMNOOOOOORRRRRSSTTTTTTTUUUWW
it's hard to guess that she means
Though allied with Robert, I grow tired of him and sell him out to the guards.
Just for fun, note that this message does leave open the possibility of a fireball (because it contains all of the letters in "FIREBALL"), in case Alice thinks that's something Bob would want to rule out.
edited Nov 23 at 15:52
Ben Bolker
1033
answered Nov 22 at 23:07
amalloy
1694
An alternative to hash commitment that requires less technical knowhow: do what scientists used to do to establish priority for an idea until they were ready to publish. Instead of a SHA, publish a signature that is easily derived from the message by a human but can't be easily reversed.
One simple "signature" is just to show how many times each letter appears in the message, but not their order. Then when it's time to reveal, it's easy to verify. So Alice can sign the message
I betray Bob
as
ABBBEIORTY
One obvious problem is that for such a short, straightforward message, Bob can probably guess what is meant: there are a lot of Bs and one O, so it's probably about him. He can also rule out some possibilities he's worried about: the message clearly can't include fireball, because there's no F; but it could include betray.
Alice can prevent this by speaking somewhat more cryptically or using a few more words than necessary. If Alice publishes
AAABDDDDEEEEEFGGGHHHHHHIIIIIILLLLMMNOOOOOORRRRRSSTTTTTTTUUUWW
it's hard to guess that she means
Though allied with Robert, I grow tired of him and sell him out to the guards.
Just for fun, note that this message does leave open the possibility of a fireball (because it contains all of the letters in "FIREBALL"), in case Alice thinks that's something Bob would want to rule out.
edited Nov 23 at 15:52
Ben Bolker
1033
answered Nov 22 at 23:07
amalloy
1694
edited Nov 23 at 15:52
Ben Bolker
1033
edited Nov 23 at 15:52
Ben Bolker
1033
edited Nov 23 at 15:52
Ben Bolker
1033
1033
answered Nov 22 at 23:07
amalloy
1694
answered Nov 22 at 23:07
amalloy
1694
answered Nov 22 at 23:07
amalloy
1694
1694
9
This is essentially re-implementing cryptography, except without tooling or the security. If Alice is good with words, she can with relative ease craft 2, or more, sentences using exactly the same set of letters, and decide on the fly which to "reveal".
– Matthieu M.
Nov 24 at 19:09
2
The answer could be improved by noting something about its practical application: How big can the phrase get before you’ve found this to be unwieldy during games?
– SevenSidedDie♦
Nov 25 at 18:00
This simplistic 'hash' also comes with the downside of not having any tool support... while googling "SHA generator" will yield hundreds of results all readily available in your browser.
– fgysin
2 days ago
add a comment |
9
This is essentially re-implementing cryptography, except without tooling or the security. If Alice is good with words, she can with relative ease craft 2, or more, sentences using exactly the same set of letters, and decide on the fly which to "reveal".
– Matthieu M.
Nov 24 at 19:09
2
The answer could be improved by noting something about its practical application: How big can the phrase get before you’ve found this to be unwieldy during games?
– SevenSidedDie♦
Nov 25 at 18:00
This simplistic 'hash' also comes with the downside of not having any tool support... while googling "SHA generator" will yield hundreds of results all readily available in your browser.
– fgysin
2 days ago
9
9
This is essentially re-implementing cryptography, except without tooling or the security. If Alice is good with words, she can with relative ease craft 2, or more, sentences using exactly the same set of letters, and decide on the fly which to "reveal".
– Matthieu M.
Nov 24 at 19:09
This is essentially re-implementing cryptography, except without tooling or the security. If Alice is good with words, she can with relative ease craft 2, or more, sentences using exactly the same set of letters, and decide on the fly which to "reveal".
– Matthieu M.
Nov 24 at 19:09
2
2
The answer could be improved by noting something about its practical application: How big can the phrase get before you’ve found this to be unwieldy during games?
– SevenSidedDie♦
Nov 25 at 18:00
The answer could be improved by noting something about its practical application: How big can the phrase get before you’ve found this to be unwieldy during games?
– SevenSidedDie♦
Nov 25 at 18:00
This simplistic 'hash' also comes with the downside of not having any tool support... while googling "SHA generator" will yield hundreds of results all readily available in your browser.
– fgysin
2 days ago
This simplistic 'hash' also comes with the downside of not having any tool support... while googling "SHA generator" will yield hundreds of results all readily available in your browser.
– fgysin
2 days ago
add a comment |
up vote
4
down vote
Trust
This one isn't always appropriate - but if you play with a constant group of friends, then simply trusting that they are being honest is the way I usually play games. This works for me, because I don't generally play with randoms or at events outside of home.
Obviously this won't always work - not everyone has the required integrity to resist the urge to cheat. But if you're playing a longer campaign with a consistent group, you'll learn pretty quickly using this method whether it's actually viable.
If not, then the other methods mentioned above are steller. However, as far as simplicity and ease to implement is concerned, this is by far the easiest.
answered Nov 22 at 23:37
Shadow
396112
add a comment |
up vote
4
down vote
Trust
This one isn't always appropriate - but if you play with a constant group of friends, then simply trusting that they are being honest is the way I usually play games. This works for me, because I don't generally play with randoms or at events outside of home.
Obviously this won't always work - not everyone has the required integrity to resist the urge to cheat. But if you're playing a longer campaign with a consistent group, you'll learn pretty quickly using this method whether it's actually viable.
If not, then the other methods mentioned above are steller. However, as far as simplicity and ease to implement is concerned, this is by far the easiest.
answered Nov 22 at 23:37
Shadow
396112
add a comment |
up vote
4
down vote
up vote
4
down vote
Trust
This one isn't always appropriate - but if you play with a constant group of friends, then simply trusting that they are being honest is the way I usually play games. This works for me, because I don't generally play with randoms or at events outside of home.
Obviously this won't always work - not everyone has the required integrity to resist the urge to cheat. But if you're playing a longer campaign with a consistent group, you'll learn pretty quickly using this method whether it's actually viable.
If not, then the other methods mentioned above are steller. However, as far as simplicity and ease to implement is concerned, this is by far the easiest.
answered Nov 22 at 23:37
Shadow
396112
Trust
This one isn't always appropriate - but if you play with a constant group of friends, then simply trusting that they are being honest is the way I usually play games. This works for me, because I don't generally play with randoms or at events outside of home.
Obviously this won't always work - not everyone has the required integrity to resist the urge to cheat. But if you're playing a longer campaign with a consistent group, you'll learn pretty quickly using this method whether it's actually viable.
If not, then the other methods mentioned above are steller. However, as far as simplicity and ease to implement is concerned, this is by far the easiest.
answered Nov 22 at 23:37
Shadow
396112
answered Nov 22 at 23:37
Shadow
396112
answered Nov 22 at 23:37
Shadow
396112
answered Nov 22 at 23:37
Shadow
396112
396112
add a comment |
add a comment |
up vote
4
down vote
I agree that some sort of cryptography is the best, but I also understand that this could be daunting for people who are not much into tech.
Here is a (hopefully) simpler way to accomplish the same.
I write a short note describing my decision.
Zip it WITH A PASSWORD (see https://community.sophos.com/kb/en-us/11489) and send the zipped file as an attachment to my email to each and every other participant.
When it is time to reveal my decision, I send out the pwd. Everyone can unzip and read what I wrote.
Note: if this is a common practice (i.e. everyone has to send out lots of "secret" messages) you better do some bookkeeping. I.e. prepare a spreadsheet or a note where you write the pwd and a short description (or maybe just date) of the encrypted message.
So whe it is time to reveal "what did you do while alone in the purple cavern" or "what was in the note you sent out on May 15th" you can go check your list and provide the appropriate pwd.
answered Nov 26 at 8:24
p.marino
2,8301419
add a comment |
up vote
4
down vote
I agree that some sort of cryptography is the best, but I also understand that this could be daunting for people who are not much into tech.
Here is a (hopefully) simpler way to accomplish the same.
I write a short note describing my decision.
Zip it WITH A PASSWORD (see https://community.sophos.com/kb/en-us/11489) and send the zipped file as an attachment to my email to each and every other participant.
When it is time to reveal my decision, I send out the pwd. Everyone can unzip and read what I wrote.
Note: if this is a common practice (i.e. everyone has to send out lots of "secret" messages) you better do some bookkeeping. I.e. prepare a spreadsheet or a note where you write the pwd and a short description (or maybe just date) of the encrypted message.
So whe it is time to reveal "what did you do while alone in the purple cavern" or "what was in the note you sent out on May 15th" you can go check your list and provide the appropriate pwd.
answered Nov 26 at 8:24
p.marino
2,8301419
add a comment |
up vote
4
down vote
up vote
4
down vote
I agree that some sort of cryptography is the best, but I also understand that this could be daunting for people who are not much into tech.
Here is a (hopefully) simpler way to accomplish the same.
I write a short note describing my decision.
Zip it WITH A PASSWORD (see https://community.sophos.com/kb/en-us/11489) and send the zipped file as an attachment to my email to each and every other participant.
When it is time to reveal my decision, I send out the pwd. Everyone can unzip and read what I wrote.
Note: if this is a common practice (i.e. everyone has to send out lots of "secret" messages) you better do some bookkeeping. I.e. prepare a spreadsheet or a note where you write the pwd and a short description (or maybe just date) of the encrypted message.
So whe it is time to reveal "what did you do while alone in the purple cavern" or "what was in the note you sent out on May 15th" you can go check your list and provide the appropriate pwd.
answered Nov 26 at 8:24
p.marino
2,8301419
I agree that some sort of cryptography is the best, but I also understand that this could be daunting for people who are not much into tech.
Here is a (hopefully) simpler way to accomplish the same.
I write a short note describing my decision.
Zip it WITH A PASSWORD (see https://community.sophos.com/kb/en-us/11489) and send the zipped file as an attachment to my email to each and every other participant.
When it is time to reveal my decision, I send out the pwd. Everyone can unzip and read what I wrote.
Note: if this is a common practice (i.e. everyone has to send out lots of "secret" messages) you better do some bookkeeping. I.e. prepare a spreadsheet or a note where you write the pwd and a short description (or maybe just date) of the encrypted message.
So whe it is time to reveal "what did you do while alone in the purple cavern" or "what was in the note you sent out on May 15th" you can go check your list and provide the appropriate pwd.
answered Nov 26 at 8:24
p.marino
2,8301419
answered Nov 26 at 8:24
p.marino
2,8301419
answered Nov 26 at 8:24
p.marino
2,8301419
answered Nov 26 at 8:24
p.marino
2,8301419
2,8301419
add a comment |
add a comment |
up vote
2
down vote
This problem was already solved in the past. As exibit A, I would introduce the game "Diplomacy" which had a prolific history of play by post. In this game, 7 players needs to coordinate (and betray) each other constantly to progress the game. There are of course direct communications between players, but any move must be committed and sent to a third party "referee". The referee would receive the moves, execute and resolve them appropriately, and then publish the outcome in a public channel (usually, a magazine, plus direct paper mail to each player.)
The only requirement here is trust with the game organizer. But why would you play if you can't trust at least the organizer?
answered Nov 23 at 9:04
STT LCU
421417
1
"... why would you play if you can't trust at least the organizer?" - probably because they don't have an external organizer, and players run it collectively.
– Nij
Nov 23 at 21:28
2
In my particular game, the gamemaster is also an adversarial player. This solution expects that the GM can be trusted on good faith, but that violates the premise of the question.
– Bloodcinder
Nov 23 at 23:35
1
@bloodcinder no it does not, he doesn’t say the player/GM has to be the organizer/referee.
– mxyzplk♦
Nov 24 at 5:46
1
The question completely forbids good faith as a helpful solution, regardless of how pedantic you get about the name for who is trusted.
– Bloodcinder
Nov 24 at 15:09
@Bloodcinder I wouldn't play under these circumstances. But I'm quite peculiar, I very rarely (if ever) play with only complete strangers.
– STT LCU
Nov 26 at 8:22
|
show 4 more comments
up vote
2
down vote
This problem was already solved in the past. As exibit A, I would introduce the game "Diplomacy" which had a prolific history of play by post. In this game, 7 players needs to coordinate (and betray) each other constantly to progress the game. There are of course direct communications between players, but any move must be committed and sent to a third party "referee". The referee would receive the moves, execute and resolve them appropriately, and then publish the outcome in a public channel (usually, a magazine, plus direct paper mail to each player.)
The only requirement here is trust with the game organizer. But why would you play if you can't trust at least the organizer?
answered Nov 23 at 9:04
STT LCU
421417
1
"... why would you play if you can't trust at least the organizer?" - probably because they don't have an external organizer, and players run it collectively.
– Nij
Nov 23 at 21:28
2
In my particular game, the gamemaster is also an adversarial player. This solution expects that the GM can be trusted on good faith, but that violates the premise of the question.
– Bloodcinder
Nov 23 at 23:35
1
@bloodcinder no it does not, he doesn’t say the player/GM has to be the organizer/referee.
– mxyzplk♦
Nov 24 at 5:46
1
The question completely forbids good faith as a helpful solution, regardless of how pedantic you get about the name for who is trusted.
– Bloodcinder
Nov 24 at 15:09
@Bloodcinder I wouldn't play under these circumstances. But I'm quite peculiar, I very rarely (if ever) play with only complete strangers.
– STT LCU
Nov 26 at 8:22
|
show 4 more comments
up vote
2
down vote
up vote
2
down vote
This problem was already solved in the past. As exibit A, I would introduce the game "Diplomacy" which had a prolific history of play by post. In this game, 7 players needs to coordinate (and betray) each other constantly to progress the game. There are of course direct communications between players, but any move must be committed and sent to a third party "referee". The referee would receive the moves, execute and resolve them appropriately, and then publish the outcome in a public channel (usually, a magazine, plus direct paper mail to each player.)
The only requirement here is trust with the game organizer. But why would you play if you can't trust at least the organizer?
answered Nov 23 at 9:04
STT LCU
421417
This problem was already solved in the past. As exibit A, I would introduce the game "Diplomacy" which had a prolific history of play by post. In this game, 7 players needs to coordinate (and betray) each other constantly to progress the game. There are of course direct communications between players, but any move must be committed and sent to a third party "referee". The referee would receive the moves, execute and resolve them appropriately, and then publish the outcome in a public channel (usually, a magazine, plus direct paper mail to each player.)
The only requirement here is trust with the game organizer. But why would you play if you can't trust at least the organizer?
answered Nov 23 at 9:04
STT LCU
421417
answered Nov 23 at 9:04
STT LCU
421417
answered Nov 23 at 9:04
STT LCU
421417
answered Nov 23 at 9:04
STT LCU
421417
421417
1
"... why would you play if you can't trust at least the organizer?" - probably because they don't have an external organizer, and players run it collectively.
– Nij
Nov 23 at 21:28
2
In my particular game, the gamemaster is also an adversarial player. This solution expects that the GM can be trusted on good faith, but that violates the premise of the question.
– Bloodcinder
Nov 23 at 23:35
1
@bloodcinder no it does not, he doesn’t say the player/GM has to be the organizer/referee.
– mxyzplk♦
Nov 24 at 5:46
1
The question completely forbids good faith as a helpful solution, regardless of how pedantic you get about the name for who is trusted.
– Bloodcinder
Nov 24 at 15:09
@Bloodcinder I wouldn't play under these circumstances. But I'm quite peculiar, I very rarely (if ever) play with only complete strangers.
– STT LCU
Nov 26 at 8:22
|
show 4 more comments
1
"... why would you play if you can't trust at least the organizer?" - probably because they don't have an external organizer, and players run it collectively.
– Nij
Nov 23 at 21:28
2
In my particular game, the gamemaster is also an adversarial player. This solution expects that the GM can be trusted on good faith, but that violates the premise of the question.
– Bloodcinder
Nov 23 at 23:35
1
@bloodcinder no it does not, he doesn’t say the player/GM has to be the organizer/referee.
– mxyzplk♦
Nov 24 at 5:46
1
The question completely forbids good faith as a helpful solution, regardless of how pedantic you get about the name for who is trusted.
– Bloodcinder
Nov 24 at 15:09
@Bloodcinder I wouldn't play under these circumstances. But I'm quite peculiar, I very rarely (if ever) play with only complete strangers.
– STT LCU
Nov 26 at 8:22
1
1
"... why would you play if you can't trust at least the organizer?" - probably because they don't have an external organizer, and players run it collectively.
– Nij
Nov 23 at 21:28
"... why would you play if you can't trust at least the organizer?" - probably because they don't have an external organizer, and players run it collectively.
– Nij
Nov 23 at 21:28
2
2
In my particular game, the gamemaster is also an adversarial player. This solution expects that the GM can be trusted on good faith, but that violates the premise of the question.
– Bloodcinder
Nov 23 at 23:35
In my particular game, the gamemaster is also an adversarial player. This solution expects that the GM can be trusted on good faith, but that violates the premise of the question.
– Bloodcinder
Nov 23 at 23:35
1
1
@bloodcinder no it does not, he doesn’t say the player/GM has to be the organizer/referee.
– mxyzplk♦
Nov 24 at 5:46
@bloodcinder no it does not, he doesn’t say the player/GM has to be the organizer/referee.
– mxyzplk♦
Nov 24 at 5:46
1
1
The question completely forbids good faith as a helpful solution, regardless of how pedantic you get about the name for who is trusted.
– Bloodcinder
Nov 24 at 15:09
The question completely forbids good faith as a helpful solution, regardless of how pedantic you get about the name for who is trusted.
– Bloodcinder
Nov 24 at 15:09
@Bloodcinder I wouldn't play under these circumstances. But I'm quite peculiar, I very rarely (if ever) play with only complete strangers.
– STT LCU
Nov 26 at 8:22
@Bloodcinder I wouldn't play under these circumstances. But I'm quite peculiar, I very rarely (if ever) play with only complete strangers.
– STT LCU
Nov 26 at 8:22
|
show 4 more comments
up vote
-3
down vote
Alice make decision message -> [D]
Encrypt [D] with random private key [PK], make cryptogram -> [C]
Lots of algorithms can be used here.
Send [C] to Bob.
When event have to occur, Bob request [PK] from Alice.
Alice Send [PK], Bob can translate [C]->[D]
it is hard to make [C] to desired other decision message[D2] with other [PK2]
Show programmer in your team this sequence. He will understand if he have learn.
edited Nov 23 at 2:51
V2Blast
18.2k248114
answered Nov 23 at 2:01
siamenock
131
New contributor
siamenock is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
6
And if there's no programmer available, how does this help anybody? The answer seems to be a much worse version of the answer posted by Chowlett hours ago.
– Nij
Nov 23 at 2:46
1
There are existing tools for this. Which one did you use when you played this kind of game?
– SevenSidedDie♦
Nov 23 at 15:39
add a comment |
up vote
-3
down vote
Alice make decision message -> [D]
Encrypt [D] with random private key [PK], make cryptogram -> [C]
Lots of algorithms can be used here.
Send [C] to Bob.
When event have to occur, Bob request [PK] from Alice.
Alice Send [PK], Bob can translate [C]->[D]
it is hard to make [C] to desired other decision message[D2] with other [PK2]
Show programmer in your team this sequence. He will understand if he have learn.
edited Nov 23 at 2:51
V2Blast
18.2k248114
answered Nov 23 at 2:01
siamenock
131
New contributor
siamenock is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
6
And if there's no programmer available, how does this help anybody? The answer seems to be a much worse version of the answer posted by Chowlett hours ago.
– Nij
Nov 23 at 2:46
1
There are existing tools for this. Which one did you use when you played this kind of game?
– SevenSidedDie♦
Nov 23 at 15:39
add a comment |
up vote
-3
down vote
up vote
-3
down vote
Alice make decision message -> [D]
Encrypt [D] with random private key [PK], make cryptogram -> [C]
Lots of algorithms can be used here.
Send [C] to Bob.
When event have to occur, Bob request [PK] from Alice.
Alice Send [PK], Bob can translate [C]->[D]
it is hard to make [C] to desired other decision message[D2] with other [PK2]
Show programmer in your team this sequence. He will understand if he have learn.
edited Nov 23 at 2:51
V2Blast
18.2k248114
answered Nov 23 at 2:01
siamenock
131
New contributor
siamenock is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Alice make decision message -> [D]
Encrypt [D] with random private key [PK], make cryptogram -> [C]
Lots of algorithms can be used here.
Send [C] to Bob.
When event have to occur, Bob request [PK] from Alice.
Alice Send [PK], Bob can translate [C]->[D]
it is hard to make [C] to desired other decision message[D2] with other [PK2]
Show programmer in your team this sequence. He will understand if he have learn.
edited Nov 23 at 2:51
V2Blast
18.2k248114
answered Nov 23 at 2:01
siamenock
131
New contributor
siamenock is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited Nov 23 at 2:51
V2Blast
18.2k248114
edited Nov 23 at 2:51
V2Blast
18.2k248114
edited Nov 23 at 2:51
V2Blast
18.2k248114
18.2k248114
answered Nov 23 at 2:01
siamenock
131
New contributor
siamenock is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered Nov 23 at 2:01
siamenock
131
answered Nov 23 at 2:01
siamenock
131
131
New contributor
siamenock is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
siamenock is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
siamenock is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
6
And if there's no programmer available, how does this help anybody? The answer seems to be a much worse version of the answer posted by Chowlett hours ago.
– Nij
Nov 23 at 2:46
1
There are existing tools for this. Which one did you use when you played this kind of game?
– SevenSidedDie♦
Nov 23 at 15:39
add a comment |
6
And if there's no programmer available, how does this help anybody? The answer seems to be a much worse version of the answer posted by Chowlett hours ago.
– Nij
Nov 23 at 2:46
1
There are existing tools for this. Which one did you use when you played this kind of game?
– SevenSidedDie♦
Nov 23 at 15:39
6
6
And if there's no programmer available, how does this help anybody? The answer seems to be a much worse version of the answer posted by Chowlett hours ago.
– Nij
Nov 23 at 2:46
And if there's no programmer available, how does this help anybody? The answer seems to be a much worse version of the answer posted by Chowlett hours ago.
– Nij
Nov 23 at 2:46
1
1
There are existing tools for this. Which one did you use when you played this kind of game?
– SevenSidedDie♦
Nov 23 at 15:39
There are existing tools for this. Which one did you use when you played this kind of game?
– SevenSidedDie♦
Nov 23 at 15:39
add a comment |
Thanks for contributing an answer to Role-playing Games Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2frpg.stackexchange.com%2fquestions%2f136072%2fhow-to-certify-a-secret-decision-revealed-on-a-delay-in-a-play-by-post-game%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
3
As a useful practical example where the described scenario would crop up, combat in Mouse Guard (and presumably other Burning Wheel system games) is resolved with the GM and players each secretly deciding on three actions before revealing them all at once and resolving the round of combat
– Pingcode
Nov 23 at 8:48
3
@Pingcode That’s a great example too of a mechanic where even a trusted GM still should not be seeing the message ahead of time. (For the unfamiliar: Mouse Guard combat is centrally about attempting to predict the opposition’s secretly-recorded maneuvers, which makes it impossible to disregard knowing that information ahead of your own choices.) I wouldn’t want the additional burden of trying to ignore full knowledge while trying to play my side of MG’s fog-of-war combat fairly.
– SevenSidedDie♦
Nov 25 at 18:06
1
I asked the question in a game-agnostic fashion because I wanted RPG.SE's expertise, but in full disclosure the game I'm playing is Tragedy Looper, which is a 1 (gamemaster) vs 3 (other players) deduction board game. Many answers and comments on those answers seem to be telling me that I'm guilty of playing a badwrongfun game, but the scenario I have described in my question is simply how some games work, and the need for decision certification doesn't go away because that scenario is unconventional.
– Bloodcinder
Nov 26 at 13:10
In fact, I'm playing with a group of close friends, and there's plenty of trust to go around. One can still desire a way to certify their own honesty even when one's honesty isn't suspect.
– Bloodcinder
Nov 26 at 13:15
Not that people should insinuate that you shouldn't play such a game regardless... But this really is why it helps to specify the game system you're playing in your post. Answers don't necessarily have to be specific to that one system, but at the least you'll ideally weed out the people providing answers that don't work in that system.
– V2Blast
2 days ago