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

来源：

THEORETICAL COMPUTER SCIENCE | 2003年 / 306卷 / 1-3期

关键词：

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 条

[1] Beaver D, 1995, LECT NOTES COMPUT SC, V963, P97
[2] Ben-Or M., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P1, DOI 10.1145/62212.62213
[3] Chaum D., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P11, DOI 10.1145/62212.62214
[4] Crepeau C, 1994, LNCS, V773, P319, DOI DOI 10.1007/3-540-48329-2_27
[5] Comparing information without leaking it
Fagin, R
Naor, M
Winkler, P
[J]. COMMUNICATIONS OF THE ACM, 1996, 39 (05) : 77 - 85
[6] FISCHER MJ, 1992, LECT NOTES COMPUT SC, V576, P141
[7] Goldreich O., P 19 ANN ACM S THEOR, P218, DOI [10.1145/28395.28420, DOI 10.1145/28395.28420]
[8] A randomness-rounds tradeoff in private computation
Kushilevitz, E
Rosen, A
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (01) : 61 - 80
[9] Naor M., 1995, LECT NOTES COMPUTER, P1, DOI DOI 10.1007/BFB0053419
[10] NAOR M, APPL KID CRYPTOGRAPH

← 1 2 →