Private computation using a PEZ dispenser

被引:28
作者
Balogh, J
Csirik, JA
Ishai, Y
Kushilevitz, E
机构
[1] Ohio State Univ, Dept Math, Columbus, OH 43210 USA
[2] Technion, Dept Comp Sci, IL-32000 Haifa, Israel
关键词
mathematical games; private computation; cryptographic protocols;
D O I
10.1016/S0304-3975(03)00210-X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:69 / 84
页数:16
相关论文
共 12 条
  • [11] RIVEST RL, 1999, UNPUB UNCONDITIONALL
  • [12] Yao A. C., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P162, DOI 10.1109/SFCS.1986.25