Filters








51,662 Hits in 6.4 sec

Private Computation: k-Connected versus 1-Connected Networks

Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
<span title="2005-05-27">2005</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7jmi32x7o5hfnpkgh2irnuqpim" style="color: black;">Journal of Cryptology</a> </i> &nbsp;
It will be shown that some functions can be computed by private protocols even if the underlying network is 1-connected but not 2-connected.  ...  We study the role of connectivity of communication networks in private computations under information theoretic settings.  ...  Private Computation on k-connected Networks Most known private protocols are written for specific networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-005-0329-x">doi:10.1007/s00145-005-0329-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hzsgdgo4kzcgfexe5nun5uznpy">fatcat:hzsgdgo4kzcgfexe5nun5uznpy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170923005042/https://eccc.weizmann.ac.il/report/2003/009/download/" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/af/e8/afe8001596adc638e73e65e3d6407959a5ad3375.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-005-0329-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Private Computation — k-Connected versus 1-Connected Networks [chapter]

Markus Bläser, Andreas Jakoby, Maciej Liśkiewicz, Bodo Siebert
<span title="">2002</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Finally, we give matching lower and upper bounds for the number of random bits needed to compute the parity function on k-connected networks 1-privately, namely (n − 2)/(k1) − 1 random bits for networks  ...  We show that some functions can be 1-privately computed even if the underlying network is 1-connected but not 2-connected.  ...  Private Computation on k-Connected Networks Most known private protocols are written for specific networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45708-9_13">doi:10.1007/3-540-45708-9_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pqcbovgqpjgyxaywtbudh424ay">fatcat:pqcbovgqpjgyxaywtbudh424ay</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430105945/http://doc.rero.ch/record/312681/files/145_2005_Article_329.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d9/22/d9224425d996df2c606c6749e239221c927e95df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45708-9_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Private computation: K-connected versus 1-connected networks

Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
<span title="2006-07-01">2006</span>
Finally, we give matching lower and upper bounds for the number of random bits needed to compute the parity function on k-connected networks 1-privately, namely (n − 2)/(k1) − 1 random bits for networks  ...  We show that some functions can be 1-privately computed even if the underlying network is 1-connected but not 2-connected.  ...  Private Computation on k-Connected Networks Most known private protocols are written for specific networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3929/ethz-b-000036683">doi:10.3929/ethz-b-000036683</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zko63g3aeranni4b4une5yax4e">fatcat:zko63g3aeranni4b4une5yax4e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220426172002/https://www.research-collection.ethz.ch/bitstream/handle/20.500.11850/36683/145_2005_Article_329.pdf;jsessionid=65E9674B1254BF097F61EE73D91F9A53?sequence=2" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9e/19/9e194fcb0090f01dc886ecbf0b1492727be73f54.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3929/ethz-b-000036683"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Profile-Based Privacy for Locally Private Computations [article]

Joseph Geumlek, Kamalika Chaudhuri
<span title="2019-06-16">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Finally, we provide mechanisms that are private in this framework, and show via simulations that they achieve higher utility than the corresponding local differential privacy mechanisms.  ...  This provides higher utility because unlike local differential privacy, we no longer need to make every pair of private values in the domain indistinguishable, and instead only protect the identity of  ...  We thank ONR under N00014-16-1-261, UC Lab Fees under LFR 18-548554 and NSF under 1804829 for research support.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1903.09084v2">arXiv:1903.09084v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4c7ytt4ynnhddghf3tml53syxi">fatcat:4c7ytt4ynnhddghf3tml53syxi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200901220952/https://arxiv.org/pdf/1903.09084v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5a/62/5a62580ba782ed58fb7f68c88d42797f59cf6fb0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1903.09084v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

On Privatizing Equilibrium Computation in Aggregate Games over Networks [article]

Shripad Gade and Anna Winnicki and Subhonmesh Bose
<span title="2019-12-13">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We prove that our algorithm does not reveal private information of players to an honest-but-curious adversary who monitors several nodes in the network.  ...  We propose a distributed algorithm to compute an equilibrium in aggregate games where players communicate over a fixed undirected network.  ...  Theorem 1. Consider a networked aggregate game defined as game(G, {f i , X i } i∈V ). If G(A c ) is connected and not bipartite, then Algorithm 1 is private.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1912.06296v1">arXiv:1912.06296v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xvoxqxy67jfcvc7dzdbzosjzsa">fatcat:xvoxqxy67jfcvc7dzdbzosjzsa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200904015335/https://arxiv.org/pdf/1912.06296v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5e/a1/5ea1c0a6524ef0a2630597adc16289680f4d6140.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1912.06296v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

ATM virtual private network design alternatives

P Crocetti, S Fotedar, L Fratta, G Gallassi, M Gerla
<span title="">1995</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mnyvgmlsc5a5xi7554ow77exfu" style="color: black;">Computer Communications</a> </i> &nbsp;
An ATM virtual private network (AVPN) offers to a multisite customer an ATM transport service based on a 'virtual' topology of dedicated VPs embedded in a larger ATM backbone.  ...  which controls the data transfer during connections. 26 computer communications volume 18 number 1 january I XC to support FRM.  ...  Keywords: virtual private networks, ATM, congestion control ATM technology makes it easy to 'embed' a virtual private network (VPN) in an ATM network (AVPN).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0140-3664(94)00748-7">doi:10.1016/0140-3664(94)00748-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zf3w7wiik5c65dh7opg6opncnu">fatcat:zf3w7wiik5c65dh7opg6opncnu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809114344/http://nrlweb.cs.ucla.edu/publication/download/567/paper4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/25/66/2566989f1b144bdc47aa347e98168516ca7a6a22.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0140-3664(94)00748-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Private Message Transmission Using Disjoint Paths [chapter]

Hadi Ahmadi, Reihaneh Safavi-Naini
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We study applications of our results to private communication over the real-life scenarios of multiplefrequency links and multiple-route networks.  ...  Interestingly, AP-PMT may be possible even in poor conditions where ta = t b = 1 and te = n − 1.  ...  To show the practical relevance of our results, we elaborate on two example scenarios of communication over multiple-frequency links and multiple-route networks and show private communication is achieved  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-07536-5_8">doi:10.1007/978-3-319-07536-5_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6pvxxw3zqbhwnpewfuzqafu3qi">fatcat:6pvxxw3zqbhwnpewfuzqafu3qi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190503011809/https://link.springer.com/content/pdf/10.1007%2F978-3-319-07536-5_8.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1d/f8/1df8758f259eb9ae503d7a81cf21142a0d7f2833.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-07536-5_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Keeping Data Private while Computing in the Cloud

Yuriy Brun, Nenad Medvidovic
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ftej443yjfel7jenws7pewa4ju" style="color: black;">2012 IEEE Fifth International Conference on Cloud Computing</a> </i> &nbsp;
Second, we deploy a prototype implementation on three different networks, including the globally-distributed PlanetLab testbed, to show that sTile is robust to network delay and efficient enough to significantly  ...  The cloud offers unprecedented access to computation. However, ensuring the privacy of that computation remains a significant challenge.  ...  For the sizes of problems we discuss next, that network size is several thousand nodes. We note that it is also possible to use a small private network, as opposed to a single private computer.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cloud.2012.126">doi:10.1109/cloud.2012.126</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/IEEEcloud/BrunM12.html">dblp:conf/IEEEcloud/BrunM12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zlad3ptxhrak3o2mx2w5adrlg4">fatcat:zlad3ptxhrak3o2mx2w5adrlg4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809043818/http://people.cs.umass.edu/~brun/pubs/pubs/Brun12cloud.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c1/41/c1410a2cb70d6697326fc0e8a26e552e0dc2786d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cloud.2012.126"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Private Edge Computing for Linear Inference Based on Secret Sharing [article]

Reent Schlegel, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat
<span title="2020-10-19">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We consider an edge computing scenario where users want to perform a linear computation on local, private data and a network-wide, public matrix.  ...  Users offload computations to edge servers located at the edge of the network, but do not want the servers, or any other party with access to the wireless links, to gain any information about their data  ...  INTRODUCTION Edge computing has established itself as a pillar of the 5G mobile network [1] to guarantee very low-latency and highbandwidth computing services.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.08593v2">arXiv:2005.08593v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mou5vwyzujgffayp4433zqkxmi">fatcat:mou5vwyzujgffayp4433zqkxmi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201023231916/https://arxiv.org/pdf/2005.08593v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ee/0a/ee0af46b35981561360fcfb44204652a581abc1f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.08593v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Efficient Private Proximity Testing with GSM Location Sketches [chapter]

Zi Lin, Denis Foo Kune, Nicholas Hopper
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Due to the simplicity of private equality testing, our resulting scheme for location tag-based private proximity testing is several orders of magnitude more efficient than previous solutions.  ...  We also explore GSM cellular networks as a new source of location tags, and demonstrate empirically that our proposed location tag scheme has strong unpredictability and reproducibility.  ...  The cellular network is then connected to the regular phone Public Switched Telephone Network (PSTN) system [5] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-32946-3_7">doi:10.1007/978-3-642-32946-3_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2cl54cd54zgqrhpf6uyuj2wx2m">fatcat:2cl54cd54zgqrhpf6uyuj2wx2m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120713231909/http://www-users.cs.umn.edu/~hopper/location_sketch_fc12.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/c4/7fc44f194e33a8a923b5f73b6004bdaeac301bdd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-32946-3_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Authenticating Privately over Public Wi-Fi Hotspots

Aldo Cassola, Erik-Oliver Blass, Guevara Noubir
<span title="">2015</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rau5643b7ncwvh74y6p64hntle" style="color: black;">Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS &#39;15</a> </i> &nbsp;
Wi-Fi connectivity using open hotspots hosted on untrusted Access Points (APs) has been a staple of mobile network deployments for many years as mobile providers seek to offload smartphone traffic to Wi-Fi  ...  Our protocol is based on Private Information Retrieval (PIR) with an augmented cheating detection mechanism based on our extensions to the NTRU encryption scheme.  ...  This suggests relay anonymity networks are no longer a bottleneck. Figure 1 : 1 Private Information Retrieval overview. Figure 2 : 2 Architecture of the EAP-TE protocol.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2810103.2813647">doi:10.1145/2810103.2813647</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ccs/CassolaBN15.html">dblp:conf/ccs/CassolaBN15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/o7sczhletvd53arl3dqwozda2i">fatcat:o7sczhletvd53arl3dqwozda2i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190218124709/https://static.aminer.org/pdf/20170130/pdfs/ccs/2ptvx8kinsum7fo1m5a4gbagr0ehu3ye.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/85/33/8533fceefba5f3a5bc96ecfa7c0cdd7e5fccf638.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2810103.2813647"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

International Roaming Services Optimization Using Private Blockchain and Smart Contracts

Mark Renier M. Bailon, De La Salle University, Philippines
<span title="2019-06-25">2019</span> <i title="The World Academy of Research in Science and Engineering"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/naqzxq5hurh2bp2pnvwitnnx44" style="color: black;">International Journal of Advanced Trends in Computer Science and Engineering</a> </i> &nbsp;
With this setup, the blockchain is privatized yet still able to perform the essential functions of a blockchain, which are immutability, security, and transparency of data.  ...  In this example, there are five carriers connected to their blockchain network. n v v v v     (1) 1 1 2 2 1 f v v v  (2) 1 1 2 2 1 2 1 f v v f v v   (3) Figure 1 : 1 Figure 1: Tendermint Consensus  ...  The share of Validator i on the block k is k i f v . Validator 1 is the selected proposer for block 1 and wants to exclude Validator 2's signature.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30534/ijatcse/2019/32832019">doi:10.30534/ijatcse/2019/32832019</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2g45lyz535fgpoui2qjvoywrla">fatcat:2g45lyz535fgpoui2qjvoywrla</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220308053850/http://www.warse.org/IJATCSE/static/pdf/file/ijatcse32832019.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a6/d7/a6d796b442ba84cc5ce09b5ff8121e63c06a6fd5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.30534/ijatcse/2019/32832019"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Private Retrieval, Computing and Learning: Recent Progress and Future Challenges [article]

Sennur Ulukus, Salman Avestimehr, Michael Gastpar, Syed Jafar, Ravi Tandon, Chao Tian
<span title="2021-07-30">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
(privacy in distributed computing), and how to learn/train machine learning models from private data spread across multiple users (privacy in distributed (federated) learning).  ...  This article focuses on three such functions: how to privately retrieve information from cyberspace (privacy in information retrieval), how to privately leverage large-scale distributed/parallel processing  ...  Within the scope of this article, the connection between PIR, secure distributed computing, and private federated learning is exemplified by the idea of cross-subspace alignment (CSA) which extends to  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.00026v1">arXiv:2108.00026v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6guz4ejeuvfffi6e46abosf7vq">fatcat:6guz4ejeuvfffi6e46abosf7vq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210804070600/https://arxiv.org/pdf/2108.00026v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8c/cf/8ccfcfaadb7afdb450ffb187aecbe03db2de809f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.00026v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Predicting Private Company Exits Using Qualitative Data [chapter]

Harish S. Bhat, Daniel Zaelit
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Private companies backed by venture capitalists or private equity funds receive their funding in a series of rounds.  ...  Our results show that a late-stage investor may be able to leverage purely qualitative knowledge of a company's first three rounds of funding to assess the probability that (1) the company will not go  ...  In this case, our network prescribes a connection between the two investors that is not present in reality.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-20841-6_33">doi:10.1007/978-3-642-20841-6_33</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c3l23laqt5dk7cpjbcpdwrf3ym">fatcat:c3l23laqt5dk7cpjbcpdwrf3ym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808005818/http://faculty.ucmerced.edu/hbhat/BhatZaelit.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/93/96/9396db3fa06a9002ffb5f3dc5e3616f34236d967.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-20841-6_33"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Private and resilient data aggregation

Mathieu Cunche, Cedric Lauradoux, Marine Minier, Roksana Boreli
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2zaau7xitzdupllip6mf432p5m" style="color: black;">38th Annual IEEE Conference on Local Computer Networks</a> </i> &nbsp;
We present a novel private and resilient aggregation system, in which an aggregator combines the data collected from sensor nodes and forwards the resulting sum to an analyst.  ...  Our scheme protects the privacy of the users from both honest-but-curious aggregator and analyst, while enabling the filtering of fake data values using a Private Range Test protocol.  ...  We consider a flat sensor network architecture, in which all sensors are directly connected to an aggregator that collects and combines the received values, before sending the aggregate to an analyst.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lcn.2013.6761329">doi:10.1109/lcn.2013.6761329</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/lcn/CuncheLMB13.html">dblp:conf/lcn/CuncheLMB13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6b373ilofvgcxicdn66leyncdi">fatcat:6b373ilofvgcxicdn66leyncdi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502153959/https://hal.inria.fr/hal-00842914/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/39/02/3902f35652bba7411660b652953af404fb0b8df2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lcn.2013.6761329"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 51,662 results