Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem (Q2632011): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:22, 3 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
