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

Lattice Centering and Coordination Number02:33

Lattice Centering and Coordination Number

10.8K
The structure of a crystalline solid, whether a metal or not, is best described by considering its simplest repeating unit, which is referred to as its unit cell. The unit cell consists of lattice points that represent the locations of atoms or ions. The entire structure then consists of this unit cell repeating in three dimensions. The three different types of unit cells present in the cubic lattice are illustrated in Figure 1.
Types of Unit Cells
Imagine taking a large number of identical...
10.8K
Bewley Lattice Diagram01:12

Bewley Lattice Diagram

1.1K
The Bewley lattice diagram, developed by L. V. Bewley, effectively organizes the reflections occurring during transmission-line transients. It visually represents how voltage waves propagate and reflect within a transmission line, making it easier to understand the complex interactions that occur.
1.1K
Synthetic Disvision of Polynomials01:28

Synthetic Disvision of Polynomials

39
Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
39
Norton's Theorem01:14

Norton's Theorem

1.1K
Norton's theorem is a fundamental principle stating that a linear two-terminal circuit can be substituted with an equivalent circuit, which comprises a current source (ⅠN) in parallel with a resistor (RN). Here, ⅠN represents the short-circuit current flowing through the terminals, and RN stands for the input or equivalent resistance at the terminals when all independent sources are deactivated. This implies that the circuit illustrated in Figure (a) can be exchanged with the one depicted...
1.1K
Singularity Functions for Shear01:26

Singularity Functions for Shear

312
In structural analysis, singularity functions are crucial in simplifying the representation of shear forces in beams under discontinuous loading. These functions describe discontinuous  variations in shear force across a beam with varying loads by using a single mathematical expression, regardless of the complexity of the loading conditions. The singularity functions are derived from creating a free-body diagram of the beam and then making conceptual cuts at specific points to examine the...
312
Masking and Demasking Agents01:19

Masking and Demasking Agents

3.1K
EDTA titrations may necessitate masking and demasking agents to temporarily protect a particular metal ion in a mixture from the EDTA reaction. These agents facilitate the sequential analysis of the metal ions by forming stable complexes with some—but not all—metal ions during certain steps.
There are many masking agents, such as cyanide, fluoride, triethanolamine, thiourea, and 2,3-bis(sulfanyl)propan-1-ol (formerly 2,3-dimercapto-1-propanol), with the masking agent chosen based on...
3.1K

You might also read

Related Articles

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

Sort by
Same author

Epidemiological correlations and seasonal patterns of osteoporosis and its comorbidities: a 14-year big data analysis using search engine trends.

Frontiers in public health·2026
Same author

DMXAA accelerates orthodontic tooth movement via macrophage-mediated Rab13-enriched extracellular vesicle release and chemokine secretion.

Progress in orthodontics·2026
Same author

The heterogeneity of dopamine-mediated vasodilation in human intrarenal arteries.

Journal of advanced research·2026
Same author

Rb<sub>2</sub>ZnGe<sub>3</sub>Se<sub>8</sub>: A Large-Birefringence Layered Chalcogenide Enabled by Anisotropic Electrons in Tetrahedral Units.

Inorganic chemistry·2026
Same author

Fully automated free-breathing cardiac magnetic resonance imaging at 3T: A prospective randomized study of image quality, efficiency, and workflow burden.

Journal of cardiovascular magnetic resonance : official journal of the Society for Cardiovascular Magnetic Resonance·2026
Same author

RCodSpace: A Robust Learned Coding Method for Deep Space Visual Transmission.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026

Related Experiment Video

Updated: Nov 22, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

945

A Lattice-Based Homomorphic Proxy Re-Encryption Scheme with Strong Anti-Collusion for Cloud Computing.

Juyan Li1,2, Zhiqi Qiao1, Kejia Zhang1

  • 1College of Data Science and Technology, Heilongjiang University, Harbin 150080, China.

Sensors (Basel, Switzerland)
|January 7, 2021
PubMed
Summary
This summary is machine-generated.

This study introduces the first lattice-based homomorphic proxy re-encryption scheme (HPRE-SAC) resistant to strong collusion attacks. The new scheme offers enhanced security for cloud computing with smaller parameters.

Keywords:
LWEcloud computinghomomorphic proxy re-encryptionkey switchingstrong anti-collusiontrapdoor sampling

More Related Videos

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm
06:18

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

Published on: October 20, 2022

2.4K
The HoneyComb Paradigm for Research on Collective Human Behavior
06:48

The HoneyComb Paradigm for Research on Collective Human Behavior

Published on: January 19, 2019

9.6K

Related Experiment Videos

Last Updated: Nov 22, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

945
The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm
06:18

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm

Published on: October 20, 2022

2.4K
The HoneyComb Paradigm for Research on Collective Human Behavior
06:48

The HoneyComb Paradigm for Research on Collective Human Behavior

Published on: January 19, 2019

9.6K

Area of Science:

  • Cryptography
  • Computer Science
  • Information Security

Background:

  • Homomorphic proxy re-encryption (HPRE) schemes combine homomorphic encryption and proxy re-encryption, enabling ciphertext conversion and homomorphic computation, making them suitable for cloud computing.
  • Existing HPRE schemes are vulnerable to strong collusion attacks, as demonstrated by Yin et al., due to their reliance on key switching algorithms for re-encryption keys.
  • This vulnerability limits the security of sensitive data in cloud environments utilizing HPRE.

Purpose of the Study:

  • To construct the first lattice-based homomorphic proxy re-encryption scheme with strong anti-collusion capabilities (HPRE-SAC).
  • To address the security limitations of existing HPRE schemes against strong collusion attacks.
  • To develop a scheme suitable for secure cloud computing applications.

Main Methods:

  • Utilized lattice-based cryptography for scheme construction.
  • Employed the TrapGen algorithm to generate an encryption key and trapdoor.
  • Applied trapdoor sampling to generate decryption and re-encryption keys.
  • Used a key switching algorithm solely for generating the evaluation key to maintain ciphertext homomorphism.

Main Results:

  • Successfully constructed the HPRE-SAC, the first lattice-based HPRE scheme resistant to strong collusion attacks.
  • The proposed HPRE-SAC scheme demonstrates resilience against strong collusion attacks.
  • The scheme achieves smaller parameters compared to existing homomorphic proxy re-encryption schemes.

Conclusions:

  • The developed lattice-based HPRE-SAC scheme effectively resists strong collusion attacks.
  • This advancement provides enhanced security for data processing in cloud computing environments.
  • The scheme's smaller parameters offer practical advantages for implementation.