151 reputation
4
bio website l3.ms
location Germany
age
visits member for 7 months
seen Aug 14 at 21:16
<profile user="leemes">
  <programming>
    <language name="C++" knowledge="above intermediate"/>
    <language name="PHP" knowledge="intermediate"/>
    <language name="Haskell" knowledge="moderate"/>
    <language name="Java" knowledge="moderate"/>
    <language name="VB6" knowledge="trying to unlearn"/>
  </programming>
  <education>
    <study what="Computer Science, M.Sc."
           where="KIT, Germany"/>
  </education>
</profile>

Jul
15
awarded  Nice Question
Jan
6
comment Shared secret: Generating Random Permutation
If I implement something like you suggest, there is a different problem: requiring only $t < N$ players to unveil the secret makes it possible for a cooperating subset of players of size $t$ to gang up against one or more opponents, as they can unveil their cards. So one of my requirement is that $t = N$.
Jan
6
comment Shared secret: Generating Random Permutation
@HenrickHellström Thanks for your input. Disconnecting without reconnecting is then considered "giving up", with the whole game terminating. I actually don't try to implement Poker, that's just a simple scenario everyone understands. The goal is to construct game protocols using some primitives of this kind (random numbers, random permutations etc.). Such a protocol "framework", if you want to call it like that, has then some restrictions like the disability to continue the game once one player leaves the "table". Maybe Poker doesn't fit in this scheme very well.
Jan
6
comment Shared secret: Generating Random Permutation
@HenrickHellström Yeah I realize that extending Mental Poker from 2 to $N$ players is a remaining problem, but when I require all $N$ player's machines to remain present (even when it's not their turn) I guess it's straightforward. The paper uses double encryption, that becomes arbitrarily long chained encryption. I hope this works; I haven't thought enough to be sure.
Jan
6
comment Shared secret: Generating Random Permutation
Thanks @J.D. This paper seems to be about the EXACT same problem. What a coincidence!
Jan
6
awarded  Supporter
Jan
6
comment Deterministically combine more than one source of entropy
In some languages there is a frac(x) which equals x - floor(x) for non-negative values of x (I'm not sure how it behaves for negative values)
Jan
6
awarded  Editor
Jan
6
revised Shared secret: Generating Random Permutation
corrected wrong game name "Mexle" => "Mia"; minor fixes
Jan
6
revised Shared secret: Generating Random Permutation
corrected wrong game name "Mexle" => "Mia"
Jan
6
awarded  Student
Jan
6
asked Shared secret: Generating Random Permutation