<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T05:39:18Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/153685" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/153685</identifier><datestamp>2024-03-14T03:21:58Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131022</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Raskar, Ramesh</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Vepakomma, Praneeth</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Program in Media Arts and Sciences (Massachusetts Institute of Technology)</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2024-03-13T13:26:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-03-13T13:26:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024-02</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2024-02-14T18:54:48.800Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1721.1/153685</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Data in today’s world is increasingly siloed across a wide variety of entities with varying resource constraints. The quality of wisdom generated from a collaborative processing of such data is substantially better if the data from all these entities is shared across each other or centralized at a nodal entity. Such data sharing and centralization is often prohibited due to stringent privacy regulations, computational constraints, communication bottlenecks, trade secrets, trust issues and competition. This necessitates development of efficient methods for distributed computation while preserving privacy to generate wisdom whose quality is on par with the case of data centralization. This thesis covers methods introduced for the same in an inter-disciplinary manner to tackle several such problems using distributed and private computation.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">Ph.D.</dim:field>
   <dim:field mdschema="dc" element="publisher">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights">In Copyright - Educational Use Permitted</dim:field>
   <dim:field mdschema="dc" element="rights">Copyright retained by author(s)</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">https://rightsstatements.org/page/InC-EDU/1.0/</dim:field>
   <dim:field mdschema="dc" element="title">Connecting silos with distributed and private computation</dim:field>
   <dim:field mdschema="dc" element="type">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="mit" element="thesis" qualifier="degree">Doctoral</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Doctor of Philosophy</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="b6ab220e-21af-42e1-a653-433531eb6de6">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
   	&lt;Title>Connecting silos with distributed and private computation&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2024-02&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Vepakomma, Praneeth&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>https://rightsstatements.org/page/InC-EDU/1.0/&lt;/License>
   	&lt;Abstract>Data in today’s world is increasingly siloed across a wide variety of entities with varying resource constraints. The quality of wisdom generated from a collaborative processing of such data is substantially better if the data from all these entities is shared across each other or centralized at a nodal entity. Such data sharing and centralization is often prohibited due to stringent privacy regulations, computational constraints, communication bottlenecks, trade secrets, trust issues and competition. This necessitates development of efficient methods for distributed computation while preserving privacy to generate wisdom whose quality is on par with the case of data centralization. This thesis covers methods introduced for the same in an inter-disciplinary manner to tackle several such problems using distributed and private computation.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>