Secure Multi-Party Computational Geometry
Mikhail Atallah - CERIAS /Purdue CS Department
Feb 13, 2002
AbstractThe general secure multi-party computation problem is when multiple parties (say, Alice and Bob) each have private data (respectively, a and b) and seek to compute some function f(a,b) without revealing to each other anything unintended (i.e., anything other than what can be inferred from knowing f(a,b)). It is well known that, in theory, the general secure multi-party computation problem is solvable using circuit evaluation protocols. While this approach is appealing in its generality, the communication complexity of the resulting protocols depend on the size of the circuit that expresses the functionality to be computed. Using the solutions derived from these general results to solve specific problems is typically quite impractical; problem-specific solutions should be developed, for efficiency reasons. We give simple solutions to some geometric problems, and in doing so we develop some building blocks that have already been useful in the solution of other combinatorial problems as well.
About the SpeakerProfessor Atallah\'s current research interests are in information security (in particular, software security, secure protocols, and watermarking). He received a Presidential Young Investigator Award from the National Science Foundation in 1985. For more on Professor Atallah\'s accomplishments check out his entire biography
The views, opinions and assumptions expressed in these videos are those of the presenter and do not necessarily reflect the official policy or position of CERIAS or Purdue University. All content included in these videos, are the property of Purdue University, the presenter and/or the presenter’s organization, and protected by U.S. and international copyright laws. The collection, arrangement and assembly of all content in these videos and on the hosting website exclusive property of Purdue University. You may not copy, reproduce, distribute, publish, display, perform, modify, create derivative works, transmit, or in any other way exploit any part of copyrighted material without permission from CERIAS, Purdue University.