Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem (Q2632011): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123129422, #quickstatements; #temporary_batch_1707303357582 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: fhe / rank | |||
Normal rank | |||
Revision as of 02:47, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem |
scientific article |
Statements
Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem (English)
0 references
17 May 2019
0 references
fully homomorphic encryption
0 references
non-binary plaintexts
0 references
bootstrapping
0 references
