By Topic

Privacy-preserving path-inclusion protocol through oblivious automata

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Meishan Huang ; College of Mathematics and Computer Science, Fuzhou University, Fuzhou, China ; Bogang Lin ; Yang Yang

This paper focuses on path-inclusion secure two-party computation problem, and an efficient protocol for securely computing the path-inclusion problem is proposed. This problem is defined in the two parties setting, where Alice and Bob both have a path. The goal of Bob is to learn whether his path is included by the path Alice holds, without revealing it to Alice or learning anything else about Alice's path. Our construction is based on an automata evaluation sub-protocol. In our protocol, each path is coded into a string which reserves all information about the original path. Then both parties are involved in the automata evaluation sub-protocol. Finally one of them can learn whether one path includes the other one.

Published in:

Intelligent Control, Automatic Detection and High-End Equipment (ICADE), 2012 IEEE International Conference on

Date of Conference:

27-29 July 2012