Comparing information without leaking it

被引：157

作者：

Fagin, R

Naor, M

Winkler, P

机构：

[1] IBM RES CORP, ALMADEN RES CTR, FDN COMP SCI GRP, SAN JOSE, CA 95120 USA

[2] WEIZMANN INST SCI, DEPT APPL MATH & COMP SCI, IL-76100 REHOVOT, ISRAEL

[3] AT&T BELL LABS, MATH SCI RES CTR, MURRAY HILL, NJ 07974 USA

来源：

COMMUNICATIONS OF THE ACM | 1996年 / 39卷 / 05期

关键词：

D O I：

10.1145/229459.229469

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

How can two people determine without revealing anything else to each other whether they possess the same information-in case they do not? There are surprisingly simple solutions.

引用

页码：77 / 85

页数：9

共 21 条

[1] BOUNDED-WIDTH POLYNOMIAL-SIZE BRANCHING PROGRAMS RECOGNIZE EXACTLY THOSE LANGUAGES IN NC [J].

BARRINGTON, DA .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 38 (01) :150-164

[2]

Ben-Or Michael, 1988, P 20 ANN ACM S THEOR, P1, DOI DOI 10.1145/62212.62213

[3] A FAIR PROTOCOL FOR SIGNING CONTRACTS [J].

BENOR, M ;

GOLDREICH, O ;

MICALI, S ;

RIVEST, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (01) :40-46

[4]

BRASSARD G, 1987, LECT NOTES COMPUT SC, V263, P234

[5]

CARTER L, 1979, J CSS, V18, P143, DOI DOI 10.1016/0022-0000(79)90044-8

[6]

Chaum D., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P11, DOI 10.1145/62212.62214

[7] A ZERO-ONE LAW FOR BOOLEAN PRIVACY [J].

CHOR, B ;

KUSHILEVITZ, E .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 1991, 4 (01) :36-47

[8]

CLEVE R, 1987, LECT NOTES COMPUTER, V435, P573

[9]

Crepeau C, 1994, LNCS, V773, P319, DOI DOI 10.1007/3-540-48329-2_27

[10] A RANDOMIZED PROTOCOL FOR SIGNING CONTRACTS [J].

EVEN, S ;

GOLDREICH, O ;

LEMPEL, A .

COMMUNICATIONS OF THE ACM, 1985, 28 (06) :637-647

← 1 2 3 →