Asset Details
Do you wish to reserve the book?
Communication and Round Balanced Oblivious FSM Evaluation
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Communication and Round Balanced Oblivious FSM Evaluation
Do you wish to request the book?
Communication and Round Balanced Oblivious FSM Evaluation
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Dissertation
Communication and Round Balanced Oblivious FSM Evaluation
2016
Overview
Privacy is a major issue in the age of the Internet. Many advances are being made in Cryptography regarding performing computations over private data, both in homomorphic encryption, multi-party computation, and applications that put these to use. Herein we present a multiparty protocol for the private evaluation of a finite state machine. We motivate this by noting that many features can be extracted from text using the finite state transducer, an easy extension of the general FSM. For example, this protocol could be used as the feature extraction phase of an end-to-end private machine learning algorithm over text inputs. Our protocol(s) build on those previously developed by offering a different balance between communication, computation and rounds. Notably, we offer a 2-round protocol with fairly low communication. The previous constant round protocol had higher communication, and the previous low communication protocol had rounds proportional to the input size. A very computation efficient version is provided if a third party is available who is not trusted beyond non-collusion. And a more computationally intensive version removes the need for this helper.
