A Solution of Path-Inclusion Secure Two-Party Computation Problem
An efficient protocol for computing securely the path-inclusion problem is presented in this paper.This problem is defined in the two parties setting, where Alice and Bob both have a path.Both of them want to know whether his/her path is included by the other path, without revealing any private information about own path to the other.Our construction is based on secure set intersection subprotocol which is of independent interest.In our protocol, each path is coded into a set which reserves all information about the original path.Then both parties jointly solve the set-inclusion problem.Finally they can learn whether one path includes the other one from the output of set-inclusion subprotocol.
Path-inclusion secure multi-party computation set-inclusion security analysis
Meishan Huang Bogang Lin
College of Mathematics and Computer Science, Fuzhou University, Fuzhou, China
国内会议
武汉
英文
419-422
2011-11-02（万方平台首次上网日期，不代表论文的发表时间）