7 citations · 14 across the 6 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CR2018
Securely Solving the Distributed Graph Coloring Problem
Yuan Hong, Jaideep Vaidya, Haibing Lu
Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem…
cs.CR2018
Efficient Determination of Equivalence for Encrypted Data
Jason N. Doctor, Jaideep Vaidya, Xiaoqian Jiang +6
Secure computation of equivalence has fundamental application in many different areas, including healthcare. We study this problem in the context of matching an individual identity…