{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/61569"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/61569","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Provable and practical location privacy for vehicular and mobile systems","abstract":"In recent years, there has been a rapid evolution of location-based vehicular and mobile services (e.g., electronic tolling, congestion pricing, traffic statistics, insurance pricing, location-based social applications), which promise tremendous benefits to users. Unfortunately, most such systems pose a serious threat to the location privacy of users because they track each individual's path. A question that arises naturally is how can we preserve location privacy of users while maintaining the benefits of such services? In this thesis, we address this question by tackling two general problems that are the foundation of many of the aforementioned services. The first problem is how to enable an untrusted server to compute agreed-upon functions on a specific user's path without learning the user's path. We address this problem in a system called VPriv. VPriv supports a variety of applications including electronic tolling, congestion pricing, insurance premium computation, and some kinds of social applications. The second problem is how to enable an untrusted server to compute aggregate statistics over all users' paths without learning any specific user's path. We tackle this problem in a system called PrivStats. With PrivStats, one can compute statistics such as traffic statistics (e.g., average speed at an intersection, average delay on a road, number of drivers at a location) or average ratings of a location in a social application. The computation and threat models for VPriv and PrivStats are different, and required markedly different solutions. For both systems, we provide formal definitions of location privacy and prove that our protocols achieve these definitions. We implemented and evaluated both systems, and concluded that they are practical on commodity hardware and smartphones.","abstract_html":"In recent years, there has been a rapid evolution of location-based vehicular and mobile services (e.g., electronic tolling, congestion pricing, traffic statistics, insurance pricing, location-based social applications), which promise tremendous benefits to users. Unfortunately, most such systems pose a serious threat to the location privacy of users because they track each individual&#x27;s path. A question that arises naturally is how can we preserve location privacy of users while maintaining the benefits of such services? In this thesis, we address this question by tackling two general problems that are the foundation of many of the aforementioned services. The first problem is how to enable an untrusted server to compute agreed-upon functions on a specific user&#x27;s path without learning the user&#x27;s path. We address this problem in a system called VPriv. VPriv supports a variety of applications including electronic tolling, congestion pricing, insurance premium computation, and some kinds of social applications. The second problem is how to enable an untrusted server to compute aggregate statistics over all users&#x27; paths without learning any specific user&#x27;s path. We tackle this problem in a system called PrivStats. With PrivStats, one can compute statistics such as traffic statistics (e.g., average speed at an intersection, average delay on a road, number of drivers at a location) or average ratings of a location in a social application. The computation and threat models for VPriv and PrivStats are different, and required markedly different solutions. For both systems, we provide formal definitions of location privacy and prove that our protocols achieve these definitions. We implemented and evaluated both systems, and concluded that they are practical on commodity hardware and smartphones.","abstract_has_math":false,"creators":["Popa, Raluca Ada"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Hari Balakrishnan."],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010","date_published":"2010","updated_at":"2026-07-22T22:21:41Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/61569","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Hari Balakrishnan."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Popa, Raluca Ada"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2011-03-07T15:16:35Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2011-03-07T15:16:35Z"]},{"key":"dc:date.issued","label":"Date","values":["2010"]},{"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":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about 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/61569"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 87-91)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In recent years, there has been a rapid evolution of location-based vehicular and mobile services (e.g., electronic tolling, congestion pricing, traffic statistics, insurance pricing, location-based social applications), which promise tremendous benefits to users. Unfortunately, most such systems pose a serious threat to the location privacy of users because they track each individual's path. A question that arises naturally is how can we preserve location privacy of users while maintaining the benefits of such services? In this thesis, we address this question by tackling two general problems that are the foundation of many of the aforementioned services. The first problem is how to enable an untrusted server to compute agreed-upon functions on a specific user's path without learning the user's path. We address this problem in a system called VPriv. VPriv supports a variety of applications including electronic tolling, congestion pricing, insurance premium computation, and some kinds of social applications. The second problem is how to enable an untrusted server to compute aggregate statistics over all users' paths without learning any specific user's path. We tackle this problem in a system called PrivStats. With PrivStats, one can compute statistics such as traffic statistics (e.g., average speed at an intersection, average delay on a road, number of drivers at a location) or average ratings of a location in a social application. The computation and threat models for VPriv and PrivStats are different, and required markedly different solutions. For both systems, we provide formal definitions of location privacy and prove that our protocols achieve these definitions. We implemented and evaluated both systems, and concluded that they are practical on commodity hardware and smartphones."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Provable and practical location privacy for vehicular and mobile systems"]}]}],"canonical_facts":{"dc:contributor.advisor":["Hari Balakrishnan."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Popa, Raluca Ada"],"dc:date.accessioned":["2011-03-07T15:16:35Z"],"dc:date.available":["2011-03-07T15:16:35Z"],"dc:date.issued":["2010"],"dc:description":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 87-91)."],"dc:description.abstract":["In recent years, there has been a rapid evolution of location-based vehicular and mobile services (e.g., electronic tolling, congestion pricing, traffic statistics, insurance pricing, location-based social applications), which promise tremendous benefits to users. Unfortunately, most such systems pose a serious threat to the location privacy of users because they track each individual's path. A question that arises naturally is how can we preserve location privacy of users while maintaining the benefits of such services? In this thesis, we address this question by tackling two general problems that are the foundation of many of the aforementioned services. The first problem is how to enable an untrusted server to compute agreed-upon functions on a specific user's path without learning the user's path. We address this problem in a system called VPriv. VPriv supports a variety of applications including electronic tolling, congestion pricing, insurance premium computation, and some kinds of social applications. The second problem is how to enable an untrusted server to compute aggregate statistics over all users' paths without learning any specific user's path. We tackle this problem in a system called PrivStats. With PrivStats, one can compute statistics such as traffic statistics (e.g., average speed at an intersection, average delay on a road, number of drivers at a location) or average ratings of a location in a social application. The computation and threat models for VPriv and PrivStats are different, and required markedly different solutions. For both systems, we provide formal definitions of location privacy and prove that our protocols achieve these definitions. We implemented and evaluated both systems, and concluded that they are practical on commodity hardware and smartphones."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/61569"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Provable and practical location privacy for vehicular and mobile systems"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:41Z"}