Cryptoprotocols: Subscription to a Public Key, The Secret Blocking and The Multi-Player Mental Poker Game (extended abstract)
Investigating the capabilities of public key and related cryptographic techniques has recently become an important area of cryptographic research. In this paper we present some new algorithms and cryptographic protocols (Cryptoprotocols) which enlarge the range of applications of public key systems and enable us to perform certain transactions in communication networks. The basic cryptographic tools used are Rabin’s Oblivious Transfer Protocol and an algorithm we developed for Number Embedding which is provably hard to invert.
We introduce the protocol Subscription to a Public Key, which gives a way to transfer keys over insecure communication channels and has useful applications to cryptosystems. We develop the Secret Blocking Protocol, specified as follows : ‘A transfers a secret to B, B can block the message. If B does not block it, there is a probability P that he might get it. (1/2 ≤ P < 1, where we can control the size of P). A does not know if the message was blocked (but he can find out later)’.
The classic cryptotransaction is the Mental Poker Game. A cryptographically secure solution to the Multi Player Mental Poker Game is given. The approach used in constructing the solution provides a general methodology of provable and modular Protocol Composition
- 1.Angluin D. Lecture notes on the complexity of some problems in number theory. Tech. Rept. 243, Dep. of Computer Science, Yale University, August, 1982.Google Scholar
- 3.Blum M. and S. Goldwasser. An Efficient Probabilistic Public-Key Scheme Which Hides All Partial Information. to appear in Proceedings of Crypto84, 1984.Google Scholar
- 4.Blum M. Three Application of the Oblivious Transfer. University of California at Berkely, September, 1981.Google Scholar
- 5.Blum M. Mental Poker. University of California at Berkely, 1982. to appearGoogle Scholar
- 8.Goldwasser, S. and Micali S. Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information. Proceedings of the 14 Annual ACM Symp. on Theory of Computing, ACM-SIGACT, May, 1982, pp. 365–377.Google Scholar
- 10.Lipton R. How to Cheat at Mental Poker. Proceeding of the AMS short course on Cryptography, AMS, January, 1981.Google Scholar
- 11.Niven I. and Zuckerman H.S.. An Introduction to the Theory of Numbers. Wiley, New York, 1981.Google Scholar
- 12.Rabin M. Digitalized Signatures and Public-key Functions as Intractable as Factorization. Tech. Rept. LCS/TR-212, MIT, January”, 1979.Google Scholar
- 13.Rabin M. Probabilistic Algorithms in Finite Fields. Tech. Rept. LCS/TR-213, MIT, January, 1979.Google Scholar
- 14.Rackoff C., S. Micali and M. Fischer. A Secure Protocol for the Oblivious Transfer. Eurocrypt 84, La Sorbonne, Paris, April, 1984.Google Scholar
- 17.Shamir A., Rivest R. Adleman L. Mental Poker. In Mathematical Gardner, Klarner D. E., Ed., Wadsworth Intrntl, 1981, pp. 37–43.Google Scholar
- 19.Yung M. K-Player Mental Poker. Master Th., Tel-Aviv University, March 1982.Google Scholar