Charles Gouert

Charles Gouert

Auto-generated profile, based on publicly available information

Charles Gouert

Department of Electrical and Computer Engineering, University of Delaware, Newark, DE, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2023 in Proceedings on Privacy Enhancing Technologies
Verified
Journal Article
Open access
PDF file
CGCharles Gouert
Charles Gouert
DMDimitris Mouris
Dimitris Mouris
NTNektarios Tsoutsos
Nektarios Tsoutsos
Fully homomorphic encryption (FHE) enables arbitrary computation on encrypted data, allowing users to upload ciphertexts to cloud servers for computation while mitigating privacy risks. Many cryptographic schemes fall under the umbrella of FHE, and each scheme has several open-source implementations with its own strengths and weaknesses. Nevertheless, developers have no straightforward way to choose which FHE scheme and implementation is best suited for their application needs, especially considering that each scheme offers different security, performance, and usability guarantees. To allow programmers to effectively utilize the power of FHE, we employ a series of benchmarks called the Terminator 2 Benchmark Suite and present new insights gained from running these algorithms with a variety of FHE back - ends. Contrary to generic benchmarks that do not take into consideration the inherent challenges of encrypted computation, our methodology is tailored to the secure computational primitives of each target FHE implementation. To ensure fair comparisons, we developed a versatile compiler(called T2) that converts arbitrary benchmarks written in a domain - specific language into identical encrypted programs running on different popular FHE libraries as a backend.Our analysis exposes for the first time the advantages and disadvantages of each FHE library as well as the types of applications most suited for each computational domain(i.e., binary, integer, and floating - point).

20 February 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
CGCharles Gouert
Charles Gouert
DMDimitris Mouris
Dimitris Mouris
NTNektarios Georgios Tsoutsos
Nektarios Georgios Tsoutsos
As cloud computing continues to gain widespread adoption, safeguarding the confidentiality of data entrusted to third-party cloud service providers becomes a critical concern. While traditional encryption methods offer protection for data at rest and in transit, they fall short when it comes to where it matters the most, i.e., during data processing. To address this limitation, we present HELM, a framework for privacy-preserving data processing using homomorphic encryption. HELM automatically transforms arbitrary programs expressed in a Hardware Description Language (HDL), such as Verilog, into equivalent homomorphic circuits, which can then be efficiently evaluated using encrypted inputs. HELM features three modes of encrypted evaluation: a) a gate mode that consists of Boolean gates, b) a small-precision lookup table mode which significantly reduces the size of the circuit by combining multiple gates into lookup tables, and c) a high-precision lookup table mode tuned for multibit arithmetic evaluations. Finally, HELM introduces a scheduler that leverages the parallelism inherent in arithmetic and Boolean circuits to efficiently evaluate encrypted programs. We evaluate HELM with the ISCAS’85 and ISCAS’89 benchmark suites, as well as real-world applications such as image filtering and neural network inference. In our experimental results, we report that HELM can outperform prior works by up to 65×.

24 February 2025 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
CGCharles Gouert
Charles Gouert
NTNektarios Georgios Tsoutsos
Nektarios Georgios Tsoutsos
Homomorphic encryption is a powerful privacy-preserving technology that is notoriously difficult to configure and use, even for experts. The key difficulties include restrictive programming models of homomorphic schemes and choosing suitable parameters for an application. In this tutorial, we outline methodologies to solve these issues and allow for conversion of any application to the encrypted domain using both leveled and fully homomorphic encryption. The first approach, called Walrus, is suitable for arithmetic-intensive applications with limited depth and applications with high throughput requirements. Walrus provides an intuitive programming interface and handles parameterization automatically by analyzing the application and gathering statistics such as homomorphic noise growth to derive a parameter set tuned specifically for the application. We provide an in-depth example of this approach in the form of a neural network inference as well as guidelines for using Walrus effectively. Conversely, the second approach (HELM) takes existing HDL designs and converts them to the encrypted domain for secure outsourcing on powerful cloud servers. Unlike Walrus, HELM supports FHE backends and is well-suited for complex applications. At a high level, HELM consumes netlists and is capable of performing logic gate operations homomorphically on encryptions of individual bits. HELM incorporates both CPU and GPU acceleration by taking advantage of the inherent parallelism provided by Boolean circuits. As a case study, we walk through the process of taking an off-the-shelf HDL design in the form of AES-128 decryption and running it in the encrypted domain with HELM.

8 July 2024 in IEEE Access
Verified
Journal Article
Open access
OAOmar Ahmed
Omar Ahmed
CGCharles Gouert
Charles Gouert
NTNektarios Georgios Tsoutsos
Nektarios Georgios Tsoutsos
Cloud computing has been a prominent technology that allows users to store their data and outsource intensive computations. However, users of cloud services are also concerned about protecting the confidentiality of their data against attacks that can leak sensitive information. Although traditional cryptography can be used to protect static data or data being transmitted over a network, it does not support processing of encrypted data. Homomorphic encryption can be used to allow processing directly on encrypted data, but a dishonest cloud provider can alter the computations performed, thus violating the integrity of the results. To overcome these issues, we propose PEEV (Parse, Encrypt, Execute, Verify), a framework that allows a developer with no background in cryptography to write programs operating on encrypted data, outsource computations to a remote server, and verify the correctness of the computations. The proposed framework relies on homomorphic encryption techniques as well as zero-knowledge proofs to achieve verifiable privacy-preserving computation. It supports practical deployments with low performance overheads and allows developers to express their encrypted programs in a high-level language, abstracting away the complexities of encryption and verification.

1 March 2022 in IEEE Security & Privacy
Verified
Journal Article
Closed access
CGCharles Gouert
Charles Gouert
NTNektarios Georgios Tsoutsos
Nektarios Georgios Tsoutsos

31 July 2020 in IEEE Access
Verified
Journal Article
Open access
DMDimitris Mouris
Dimitris Mouris
CGCharles Gouert
Charles Gouert
NGNikhil Gupta
Nikhil Gupta
NTNektarios Georgios Tsoutsos
Nektarios Georgios Tsoutsos
An ever-increasing number of industries are adopting additive manufacturing (AM), also known as 3D printing, to their production lifecycles for manufacturing parts. A computer aided design (CAD) model is used to manufacture the part. The capability for efficient search and retrieval of the CAD models from the database has become an essential need for designers and users. However, traditional search techniques perform poorly in the context of searching CAD designs. In this paper, we propose Fourier Fingerprint Search (FFS), a retrieval framework for 3D models that deduces and leverages critical shape characteristics for search. FFS introduces a novel search methodology that incorporates these characteristics and uses two advanced matching techniques that operate at different granularities and take into account unique patterns associated with each design. In addition, FFS supports both exact and partial matching in order to provide helpful and robust search results for any scenario. We investigate a diverse set of features and enhancements for search that allows for high adaptability in all situations, such as dividing shapes into smaller parts, surface interpolation, and two different types of rotation. We evaluate FFS using the FabWave CAD dataset with approximately 3000 manufacturing models with different configurations. Our experimental results demonstrate the efficiency and high accuracy of our approach for both exact and partial matching, rendering FFS a powerful framework for CAD model search.