home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.crypt
- Path: sparky!uunet!paladin.american.edu!howland.reston.ans.net!wupost!crcnis1.unl.edu!moe.ksu.ksu.edu!ux1.cso.uiuc.edu!ceblair
- From: ceblair@ux1.cso.uiuc.edu (Charles Blair)
- Subject: Re: Telephonic Poker?
- Message-ID: <C0CGLz.HF7@ux1.cso.uiuc.edu>
- Organization: University of Illinois at Urbana
- References: <1993Jan3.185628.2976@zip.eecs.umich.edu> <C0C73F.1v9@chinet.chi.il.us>
- Date: Mon, 4 Jan 1993 19:24:57 GMT
- Lines: 24
-
- RSA's intended system appeared in a paper in the book THE MATHEMATICAL
- GARDNER (papers in honor of Martin Gardner). Subsequently flaws were found
- by Lipton and probably others. One problem is that, even if you can't
- recover N from f(N), you may be able to get partial information which could
- be useful (I think the specific problem for RSA was whether N was a square).
- For more details, see CODES and CRYPTOGRAPHY by Welsh, a book by Salomaa
- whose title I can't remember, and probably other places.
-
- I think playing poker raises problems that go beyond the issues involved
- in flipping a coin over the phone, specifically figuring out how to make
- sure two people don't get the same card.
-
- A crude approach for coin flipping: I announce N = product of two big
- primes. You try to guess whether the middle digit of the smaller factor
- is even or odd. (this was off the top of my head--- no guarantee it doesn't
- have a flaw)
-
- A system for poker based on Probabilistic Encryption (rather complex,
- not straightforward use of PE) was published in FOCS or STOC by Goldwasser
- and Micali around 1982.
-
- A year or so ago, I saw a paper ``How to play any mental game.'' Didn't
- read it, but it seemed to involve interactive verification protocols.
-
-