<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Share on Bruno Pedro</title><link>https://brunopedro.com/tags/share/</link><description>Recent content in Share on Bruno Pedro</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 20 Apr 2018 17:54:46 +0200</lastBuildDate><atom:link href="https://brunopedro.com/tags/share/index.xml" rel="self" type="application/rss+xml"/><item><title>Re: Bing Tries To Buy The News on TechCrunch</title><link>https://brunopedro.com/2009/11/23/re-bing-tries-to-buy-the-news-on-techcrunch/</link><pubDate>Mon, 23 Nov 2009 10:20:46 +0000</pubDate><guid>https://brunopedro.com/2009/11/23/re-bing-tries-to-buy-the-news-on-techcrunch/</guid><description>&lt;blockquote>
&lt;p>In order to actually make a dent in Google&amp;rsquo;s market share, Bing would have to pay such exorbitant sums to so many different news companies that it would be difficult to recoup its investment. Bing certainly get some marketing buzz out of any such move, but that&amp;rsquo;s about it.&lt;/p>
&lt;/blockquote>
&lt;p>Here&amp;rsquo;s a list of links about this:&lt;/p>
&lt;ul>
&lt;li>&lt;a href="http://www.ft.com/cms/s/0/a243c8b2-d79b-11de-b578-00144feabdc0.html?nclick_check=1">Microsoft and News Corp eye web pact&lt;/a> on FT&lt;/li>
&lt;li>&lt;a href="http://searchengineland.com/thoughts-on-bing-news-corp-opec-for-news-30307">Thoughts On A &amp;ldquo;Killer&amp;rdquo; Bing-News Corp Deal &amp;amp; The Myth Of An &amp;ldquo;OPEC For News&amp;rdquo;&lt;/a> on search engine land&lt;/li>
&lt;li>&lt;a href="http://www.businessinsider.com/microsoft-offers-to-pay-news-corp-to-de-list-itself-from-google-2009-11">Microsoft Offers To Pay News Corp To &amp;ldquo;De-List&amp;rdquo; Itself From Google&lt;/a> on The Business Insider&lt;/li>
&lt;li>&lt;a href="http://www.guardian.co.uk/media/pda/2009/nov/23/microsoft-bing-news-corp">Will News Corp move its content to Microsoft&amp;rsquo;s Bing?&lt;/a> on The Guardian&lt;/li>
&lt;/ul>
&lt;p>Read the original post: &lt;a href="http://feedproxy.google.com/~r/Techcrunch/~3/_DmRup7GJ78/">Bing Tries To Buy The News on TechCrunch&lt;/a>.&lt;/p></description></item><item><title>How to share a secret</title><link>https://brunopedro.com/2009/01/03/how-to-share-a-secret/</link><pubDate>Sat, 03 Jan 2009 17:15:38 +0000</pubDate><guid>https://brunopedro.com/2009/01/03/how-to-share-a-secret/</guid><description>&lt;p>&amp;ldquo;&lt;a href="http://portal.acm.org/citation.cfm?id=359168.359176" title="How to share a secret">How to Share a Secret&lt;/a>&amp;rdquo; is the title of paper written in 1979 by &lt;a href="http://en.wikipedia.org/wiki/Adi_Shamir" title="Adi Shamir">Adi Shamir&lt;/a> (best known for his work on the &lt;a href="http://en.wikipedia.org/wiki/RSA#History">RSA&lt;/a> algorithm). The paper describes a method for dividing information in smaller pieces so that the knowledge of all but one of the pieces gives absolutely no information about the original information. Quoting the author:&lt;/p>
&lt;blockquote>
&lt;p>This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.&lt;/p></description></item></channel></rss>