论文信息 - Private computation using a PEZ dispenser

Private computation using a PEZ dispenser

We show how a (big) PEZ dispenser can be used by two or more players to compute a function of their inputs while hiding the values of the inputs from each other. In contrast to traditional approaches for solving this problem, ours does not require any use of randomness.

[1] M. Naor,et al. Applied Kid Cryptography or How To Convince Your Children You Are Not Cheating , 1999 .

[2] Moni Naor,et al. Visual Cryptography , 1994, Encyclopedia of Multimedia.

[3] Peter Winkler,et al. Comparing information without leaking it , 1996, CACM.

[4] Donald Beaver,et al. Precomputing Oblivious Transfer , 1995, CRYPTO.

[5] Joe Kilian,et al. Discreet Solitary Games , 1994, CRYPTO.

[6] InitializerRonald L. RivestLaboratory. Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer , 1999 .

[7] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8] Eyal Kushilevitz,et al. A Randomness-Rounds Tradeoff in Private Computation , 1994, SIAM J. Discret. Math..

[9] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[10] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.

[11] Michael J. Fischer,et al. Multiparty Secret Key Exchange Using a Random Deal of Cards , 1991, CRYPTO.

[12] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.

[13] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.