2014 10th International Conference on Communications (COMM) 2014
DOI: 10.1109/iccomm.2014.6866760
|View full text |Cite
|
Sign up to set email alerts
|

Comparison-based computations over fully homomorphic encrypted data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
2
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(18 citation statements)
references
References 13 publications
0
18
0
Order By: Relevance
“…Furthermore, at each of the computing nodes we implemented both container based virtualization [17] and also installed and configured the OpenMPI framework. Furthermore, to keep safe the entire processed information, we apply an encryption layer consisting in an encrypted file system, such as Linux Unified Key Setup [9], [10]. In Figure 6, you can see our servers testbed configuration.…”
Section: Testing and Resultsmentioning
confidence: 99%
“…Furthermore, at each of the computing nodes we implemented both container based virtualization [17] and also installed and configured the OpenMPI framework. Furthermore, to keep safe the entire processed information, we apply an encryption layer consisting in an encrypted file system, such as Linux Unified Key Setup [9], [10]. In Figure 6, you can see our servers testbed configuration.…”
Section: Testing and Resultsmentioning
confidence: 99%
“…It would appear further processing is necessary (additional circuit depth of log 2 n) to extract the final minimum or maximum value within the output ciphertext in a step not apparently described; perhaps being recovered after decryption. The min-max algorithm described by Togan et al [23] uses a recursive strategy to combine, in the base case, a one bit integer 'greater than' comparison relation with a selection operator both expressed in polynomial form. The overall circuit depth is similar to the approach by Kocabaş, although no ciphertext packing is involved.…”
Section: Our Contributionmentioning
confidence: 99%
“…The MSB will contain the final output for the equal circuit after log 2 n levels [34]. An alternative divide-and-conquer strategy for determining integer equality with a similar multiplicative depth is described in [23], although n − 1 homomorphic multiplications are required instead of log 2 n.…”
Section: Equality Circuitmentioning
confidence: 99%
“…In this way it is possible to install even additional software inside the container without affecting the outside operating system. Furthermore, to keep safe the entire information that is stored in containers, we apply an encryption layer consisting in an encrypted file system, such as Linux Unified Key Setup [6], [7].…”
Section: B the Anomaly Detection Systemmentioning
confidence: 99%