|
|
Volumn 15, Issue 9, 2005, Pages 851-856
|
|
Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
a
|
|
Author keywords
1 out of m oblivious transfer; Secure multi party computation; Set inclusion problem; Yao's millionaires' problem
|
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
PRIVACY-PRESERVING TECHNIQUES;
PROBLEM SOLVING;
1-OUT-OF-M OBLIVIOUS TRANSFER;
COMMUNICATION COMPLEXITY;
INCLUSION PROBLEM;
MILLIONAIRES PROBLEM;
MULTI-PARTY COMPUTATION PROTOCOLS;
NEW PROTOCOL;
OBLIVIOUS TRANSFER;
SECURE MULTI-PARTY COMPUTATION;
SET-INCLUSION PROBLEM;
YAO MILLIONAIRE' PROBLEM;
EFFICIENCY;
|
|
EID: 25844451115
PISSN: 10020071
EISSN: None
Source Type: Journal
DOI: 10.1080/10020070512331343020 Document Type: Article |
|
Times cited : (6)
|
|
References (20)
|
