{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/113458"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/113458","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Splinter : practical private queries on public data","abstract":"Every day, millions of people rely on third party services like Google Maps to navigate from A to B. With existing technology, each query provides Google and their affiliates with a track record of where they've been and where they're going. In this thesis, I design, engineer, and implement a solution that offers absolute privacy when making routing queries, through the application of the Function Secret Sharing (FSS) cryptographic primitive. I worked on a library in Golang that applied an optimized FSS protocol, and exposed an API to generate and evaluate different kinds of queries. I then built a system with servers that handle queries to the database, and clients that generate queries. I used DIMACS maps data and the Transit Node Routing (TNR) algorithm to obtain graph data hosted by the servers. Finally, I evaluated the performance of my system for practicality, and compared it to existing private map routing systems.","abstract_html":"Every day, millions of people rely on third party services like Google Maps to navigate from A to B. With existing technology, each query provides Google and their affiliates with a track record of where they've been and where they're going. In this thesis, I design, engineer, and implement a solution that offers absolute privacy when making routing queries, through the application of the Function Secret Sharing (FSS) cryptographic primitive. I worked on a library in Golang that applied an optimized FSS protocol, and exposed an API to generate and evaluate different kinds of queries. I then built a system with servers that handle queries to the database, and clients that generate queries. I used DIMACS maps data and the Transit Node Routing (TNR) algorithm to obtain graph data hosted by the servers. Finally, I evaluated the performance of my system for practicality, and compared it to existing private map routing systems.","abstract_has_math":false,"creators":["Yun, Catherine (Catherine T.)"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Vinod Vaikuntanathan."],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-07-22T22:22:08Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/113458","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Vinod Vaikuntanathan."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Yun, Catherine (Catherine T.)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-02-08T15:58:33Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-02-08T15:58:33Z"]},{"key":"dc:date.issued","label":"Date","values":["2017"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/113458"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Cataloged from student-submitted PDF version of thesis.","Includes bibliographical references (pages 39-43)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Every day, millions of people rely on third party services like Google Maps to navigate from A to B. With existing technology, each query provides Google and their affiliates with a track record of where they've been and where they're going. In this thesis, I design, engineer, and implement a solution that offers absolute privacy when making routing queries, through the application of the Function Secret Sharing (FSS) cryptographic primitive. I worked on a library in Golang that applied an optimized FSS protocol, and exposed an API to generate and evaluate different kinds of queries. I then built a system with servers that handle queries to the database, and clients that generate queries. I used DIMACS maps data and the Transit Node Routing (TNR) algorithm to obtain graph data hosted by the servers. Finally, I evaluated the performance of my system for practicality, and compared it to existing private map routing systems."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M. Eng."]},{"key":"dc:title","label":"Title","values":["Splinter : practical private queries on public data"]}]}],"canonical_facts":{"dc:contributor.advisor":["Vinod Vaikuntanathan."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Yun, Catherine (Catherine T.)"],"dc:date.accessioned":["2018-02-08T15:58:33Z"],"dc:date.available":["2018-02-08T15:58:33Z"],"dc:date.issued":["2017"],"dc:description":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Cataloged from student-submitted PDF version of thesis.","Includes bibliographical references (pages 39-43)."],"dc:description.abstract":["Every day, millions of people rely on third party services like Google Maps to navigate from A to B. With existing technology, each query provides Google and their affiliates with a track record of where they've been and where they're going. In this thesis, I design, engineer, and implement a solution that offers absolute privacy when making routing queries, through the application of the Function Secret Sharing (FSS) cryptographic primitive. I worked on a library in Golang that applied an optimized FSS protocol, and exposed an API to generate and evaluate different kinds of queries. I then built a system with servers that handle queries to the database, and clients that generate queries. I used DIMACS maps data and the Transit Node Routing (TNR) algorithm to obtain graph data hosted by the servers. Finally, I evaluated the performance of my system for practicality, and compared it to existing private map routing systems."],"dc:description.degree":["M. Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/113458"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Splinter : practical private queries on public data"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:08Z"}