<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A review of homomorphic encryption and software tools for encrypted statistical machine learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1508.06574/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1508.06574/feed.xml" rel="self" type="application/rss+xml" /><item><title>A review of homomorphic encryption and software tools for encrypted statistical machine learning — mentioned by proofofstake</title><link>https://news.ycombinator.com/item?id=14949720</link><guid isPermaLink="false">urn:hackerpapers:mention:1508.06574:14949720</guid><pubDate>Mon, 07 Aug 2017 18:08:59 GMT</pubDate><description>&lt;p&gt;They switched from structure-preserving encryption to neural encryption (using a neural net&amp;#x27;s layer activations). &amp;gt; Just a few months ago this package was released by Louis Aslett at Oxford http://www.louisaslett.com/HomomorphicEncryption/. Louis helped me use his package to do Fan and Vercauteren homomorphic encryption on my dataset. Because the ciphertexts are polynomials it&amp;#x27;s not too easy for an average data scientist to use the data. That&amp;#x27;s why I came up with more chill ways of encrypting Numerai&amp;#x27;s data that the article mentions like order-preserving encryption. There&amp;#x27;s a security vs easy…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1508.06574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>A review of homomorphic encryption and software tools for encrypted statistical machine learning — mentioned by BickNowstrom</title><link>https://news.ycombinator.com/item?id=13163878</link><guid isPermaLink="false">urn:hackerpapers:mention:1508.06574:13163878</guid><pubDate>Tue, 13 Dec 2016 02:01:10 GMT</pubDate><description>&lt;p&gt;&amp;quot;&amp;quot;&amp;quot; https://arxiv.org/abs/1508.06574 &amp;quot;An encryption scheme is said to be homomorphic if certain mathematical operations can be applied directly to the cipher text in such a way that decrypting the result renders the same answer as applying the function to the original unencrypted data.&amp;quot; The function = GradientBoostingRegressor the cipher text = X_encrypted original data = X same answer = mean absolute error &amp;quot;&amp;quot;&amp;quot; import numpy as np from sklearn.metrics import mean_absolute_error from sklearn.ensemble import GradientBoostingRegressor # Replicability np.random.seed(0) # Create a data set with…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1508.06574/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
