Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Second Uniqueness Theorem01:16

Second Uniqueness Theorem

994
Consider a region consisting of several individual conductors with a definite charge density in the region between these conductors. The second uniqueness theorem states that if the total charge on each conductor and the charge density in the in-between region are known, then the electric field can be uniquely determined.
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the...
994
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

208
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
208
Routh-Hurwitz Criterion I01:15

Routh-Hurwitz Criterion I

203
Consider an electrical power grid, where stability is essential to prevent blackouts. The Routh-Hurwitz criterion is a valuable tool for assessing system stability under varying load conditions or faults. By analyzing the closed-loop transfer function, the Routh-Hurwitz criterion helps determine whether the system remains stable.
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
203
Hückel's Rule Diagram of π MOs: Frost Circle01:08

Hückel's Rule Diagram of π MOs: Frost Circle

4.4K
The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so...
4.4K
¹H NMR Chemical Shift Equivalence: Homotopic and Heterotopic Protons01:03

¹H NMR Chemical Shift Equivalence: Homotopic and Heterotopic Protons

2.3K
Protons in identical electronic environments within a molecule are chemically equivalent and have the same chemical shift. The replacement test is a useful tool to identify chemical equivalence and predict NMR spectra. A substituent replaces each of the protons being examined and the resulting molecules are compared. If the same molecule is obtained, the protons are equivalent or homotopic. Replacement of any hydrogens in ethane by chlorine yields chloroethane because all six protons are...
2.3K
Structural Isomerism02:34

Structural Isomerism

19.1K
Isomerism in Complexes
Isomers are different chemical species that have the same chemical formula. Structural isomerism of coordination compounds can be divided into two subcategories, the linkage isomers and coordination-sphere isomers.
Linkage isomers occur when the coordination compound contains a ligand that can bind to the transition metal center through two different atoms. For example, the CN− ligand can bind through the carbon atom or through the nitrogen atom. Similarly, SCN− can...
19.1K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Efficient <i>L</i><sub>p</sub> Distance Computation Using Function-Hiding Inner Product Encryption for Privacy-Preserving Anomaly Detection.

Sensors (Basel, Switzerland)·2023
Same author

Acceleration of Inner-Pairing Product Operation for Secure Biometric Verification.

Sensors (Basel, Switzerland)·2021
Same author

Efficient and Privacy-Preserving Energy Trading on Blockchain Using Dual Binary Encoding for Inner Product Encryption.

Sensors (Basel, Switzerland)·2021
See all related articles

Related Experiment Video

Updated: Jun 17, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

6.9K

Hierarchical Clustering via Single and Complete Linkage Using Fully Homomorphic Encryption.

Lynin Sokhonn1, Yun-Soo Park1, Mun-Kyu Lee2

  • 1Department of Electrical and Computer Engineering, Inha University, Incheon 22212, Republic of Korea.

Sensors (Basel, Switzerland)
|August 10, 2024
PubMed
Summary

This study introduces secure hierarchical clustering using homomorphic encryption (HE). The novel method enables private data analysis by outsourcing computations without revealing sensitive information.

Keywords:
CKKS schemecomplete linkagehierarchical clusteringhomomorphic encryptionsingle linkage

More Related Videos

VDJ-Seq: Deep Sequencing Analysis of Rearranged Immunoglobulin Heavy Chain Gene to Reveal Clonal Evolution Patterns of B Cell Lymphoma
15:07

VDJ-Seq: Deep Sequencing Analysis of Rearranged Immunoglobulin Heavy Chain Gene to Reveal Clonal Evolution Patterns of B Cell Lymphoma

Published on: December 28, 2015

26.7K
Spatial Separation of Molecular Conformers and Clusters
10:37

Spatial Separation of Molecular Conformers and Clusters

Published on: January 9, 2014

8.9K

Related Experiment Videos

Last Updated: Jun 17, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

6.9K
VDJ-Seq: Deep Sequencing Analysis of Rearranged Immunoglobulin Heavy Chain Gene to Reveal Clonal Evolution Patterns of B Cell Lymphoma
15:07

VDJ-Seq: Deep Sequencing Analysis of Rearranged Immunoglobulin Heavy Chain Gene to Reveal Clonal Evolution Patterns of B Cell Lymphoma

Published on: December 28, 2015

26.7K
Spatial Separation of Molecular Conformers and Clusters
10:37

Spatial Separation of Molecular Conformers and Clusters

Published on: January 9, 2014

8.9K

Area of Science:

  • Computer Science
  • Cryptography
  • Data Analysis

Background:

  • Hierarchical clustering is common but poses privacy risks for sensitive data outsourced to servers.
  • Existing methods require raw data access, compromising confidentiality.

Purpose of the Study:

  • To develop a privacy-preserving hierarchical clustering method using homomorphic encryption (HE).
  • To enable secure outsourcing of sensitive data clustering tasks.

Main Methods:

  • Integration of Cheon-Kim-Kim-Song homomorphic encryption (HE) for data analysis.
  • Development of a cooperative approach for sorting encrypted distances, involving data owner and server.
  • Application to single linkage and complete linkage hierarchical clustering metrics.

Main Results:

  • Demonstrated secure hierarchical clustering without exposing raw data.
  • Successfully applied HE to single and complete linkage methods.
  • The cooperative sorting approach mitigates the resource intensity of HE.

Conclusions:

  • The proposed method ensures data confidentiality during hierarchical clustering.
  • This approach facilitates secure outsourcing of sensitive data analysis.
  • It offers a practical solution for privacy-preserving data mining.