<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://certfhewiki.certsign.ro/wiki/index.php?action=history&amp;feed=atom&amp;title=Homomorphic_Encryption_from_LWE</id>
	<title>Homomorphic Encryption from LWE - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://certfhewiki.certsign.ro/wiki/index.php?action=history&amp;feed=atom&amp;title=Homomorphic_Encryption_from_LWE"/>
	<link rel="alternate" type="text/html" href="https://certfhewiki.certsign.ro/wiki/index.php?title=Homomorphic_Encryption_from_LWE&amp;action=history"/>
	<updated>2026-05-14T18:17:43Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.34.0</generator>
	<entry>
		<id>https://certfhewiki.certsign.ro/wiki/index.php?title=Homomorphic_Encryption_from_LWE&amp;diff=119&amp;oldid=prev</id>
		<title>Gturcas: Created page with &quot;In 2013, Gentry, Sahai and Brent Waters (GSW) proposed a new technique for building FHE schemes that avoids an expensive &quot;relinearization&quot; step in homomorphic multiplication.&lt;...&quot;</title>
		<link rel="alternate" type="text/html" href="https://certfhewiki.certsign.ro/wiki/index.php?title=Homomorphic_Encryption_from_LWE&amp;diff=119&amp;oldid=prev"/>
		<updated>2020-05-26T12:46:07Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;In 2013, Gentry, Sahai and Brent Waters (GSW) proposed a new technique for building FHE schemes that avoids an expensive &amp;quot;relinearization&amp;quot; step in homomorphic multiplication.&amp;lt;...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In 2013, Gentry, Sahai and Brent Waters (GSW) proposed a new technique for building FHE schemes that avoids an expensive &amp;quot;relinearization&amp;quot; step in homomorphic multiplication.&amp;lt;ref name=GSW13&amp;gt;C. Gentry, A. Sahai, and B. Waters. [http://eprint.iacr.org/2013/340 Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based]. In &amp;#039;&amp;#039;CRYPTO 2013&amp;#039;&amp;#039; (Springer)&amp;lt;/ref&amp;gt;&lt;br /&gt;
Zvika Brakerski and Vinod Vaikuntanathan observed that for certain types of circuits, the GSW cryptosystem features an even slower growth rate of noise, and hence better efficiency and stronger security.&amp;lt;ref&amp;gt;Z. Brakerski and V. Vaikuntanathan. [http://eprint.iacr.org/2013/541 Lattice-Based FHE as Secure as PKE]. In &amp;#039;&amp;#039;ITCS 2014&amp;#039;&amp;#039;&amp;lt;/ref&amp;gt;&lt;br /&gt;
Jacob Alperin-Sheriff and Chris Peikert then described a very efficient bootstrapping technique based on this observation.&amp;lt;ref name=AP14&amp;gt;J. Alperin-Sheriff and C. Peikert. [http://eprint.iacr.org/2014/094 Faster Bootstrapping with Polynomial Error]. In &amp;#039;&amp;#039;CRYPTO 2014&amp;#039;&amp;#039; (Springer)&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
These techniques were further improved to develop efficient ring variants of the GSW cryptosystem: FHEW (2014). The FHEW scheme was the first to show that by refreshing the ciphertexts after every single operation, it is possible to reduce the bootstrapping time to a fraction of a second. FHEW introduced a new method to compute Boolean gates on encrypted data that greatly simplifies bootstrapping, and implemented a variant of the bootstrapping procedure. The efficiency of FHEW was further improved by the TFHE scheme, which implements a ring variant of the bootstrapping procedure using a method similar to the one in FHEW.&lt;/div&gt;</summary>
		<author><name>Gturcas</name></author>
		
	</entry>
</feed>