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

Maximum Size of Aggregate01:12

Maximum Size of Aggregate

982
The maximum size of aggregate is defined as the aperture of the sieve retaining 15 percent or more of the particles present in the aggregate sample. The aggregate's maximum size impacts the concrete's water requirement, workability, and strength. Larger aggregates reduce the surface area needing cement paste coverage, which can lower water needs, thereby allowing a decrease in the water-to-cement ratio when the desired workability and richness of the mix are to be maintained, which can...
982
Column Efficiency: Rate Theory01:12

Column Efficiency: Rate Theory

1.2K
The rate theory of chromatography provides quantitative insight into the shapes and widths of elution bands. These bands are based on the random-walk mechanism governing molecular migration within a column. The Gaussian profile of chromatographic bands arises from the cumulative effect of random molecular motions as they progress through the column.
During elution, a solute molecule experiences numerous transitions between stationary and mobile phases, exhibiting irregular residence times in...
1.2K
Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

2.2K
An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
2.2K
Distribution Reliability and Automation01:25

Distribution Reliability and Automation

597
Distribution reliability in electrical power systems is critical for ensuring an uninterrupted power supply to consumers at minimal cost. According to IEEE Standard Terms, reliability is the probability that a device will function without failure over a specified time period or amount of usage. For electric power distribution, this translates to maintaining continuous power supply and addressing customer concerns over power outages. Several indices, as defined by IEEE Standard 1366-2012, are...
597
Multimachine Stability01:25

Multimachine Stability

623
Multimachine stability analysis is crucial for understanding the dynamics and stability of power systems with multiple synchronous machines. The objective is to solve the swing equations for a network of M machines connected to an N-bus power system.
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
623
Bulk Modulus01:21

Bulk Modulus

890
The bulk modulus is a scientific term used to describe a material's resistance to uniform compression. It is the proportionality constant that links a change in pressure to the resulting relative volume change.
890

You might also read

Related Articles

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

Sort by
Same journal

Research on a Regional Availability Evaluation Model for Road-Area High-Entropy Energy Based on Synergy Factors.

Entropy (Basel, Switzerland)·2026
Same journal

Atmospheric Turbulence Channel Modeling and Performance Analysis of a CO-ZP-OFDM Coherent Optical Communication System for UAV Air-to-Ground Scenarios.

Entropy (Basel, Switzerland)·2026
Same journal

Information Geometry and Asymptotic Theory for SMML Estimators.

Entropy (Basel, Switzerland)·2026
Same journal

Correlation Entropy and Power-Law Kinetics.

Entropy (Basel, Switzerland)·2026
Same journal

Research on the Contagion of Systemic Financial Risk Under the Impact of Climate Risks-From the Perspective of Complex Networks and Machine Learning.

Entropy (Basel, Switzerland)·2026
Same journal

The Statistical-Mechanical Meaning of the Wave Function of Quantum Mechanics.

Entropy (Basel, Switzerland)·2026

Related Experiment Videos

Secure Multiplicative Aggregation and Key-Reuse Optimization: Achieving Dropout Resilience with Amortized Efficiency.

Hongyuan Cai1, Bei Liang2, Yue Qin2,3

  • 1Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China.

Entropy (Basel, Switzerland)
|March 28, 2026
PubMed
Summary

This study introduces a secure multiplicative aggregation protocol that computes the product of user vectors, even with dropouts. Key reusable protocols are also proposed, improving efficiency for repeated aggregations.

Keywords:
key reuseprivacysecure aggregation

Related Experiment Videos

Area of Science:

  • Cryptography
  • Distributed Computing
  • Secure Multi-Party Computation

Background:

  • Secure aggregation enables collective computation on private data.
  • Existing protocols often struggle with user dropouts or lack efficiency for repeated computations.

Purpose of the Study:

  • To develop the first secure multiplicative aggregation protocol resilient to user dropouts.
  • To propose key reusable secure aggregation protocols for efficiency in repeated computations.

Main Methods:

  • The protocol utilizes pairwise masks, threshold secret sharing, and a secure aggregation primitive.
  • Security is analyzed against semi-honest adversaries.
  • Performance is evaluated through simulations with varying user numbers, input sizes, and dropout rates.

Main Results:

  • The multiplicative aggregation protocol correctly computes the component-wise product and is secure.
  • User computation scales with the number of users and is robust to dropouts.
  • Server computation is sensitive to dropouts and scales with user numbers and input size.
  • Key reusable protocols significantly reduce cumulative computation time and overhead for repeated aggregations.

Conclusions:

  • The proposed secure multiplicative aggregation protocol offers a robust solution for collective product computation.
  • Key reusability enhances efficiency for scenarios involving multiple aggregation rounds.
  • Server computation and dropout rates are critical factors influencing protocol performance.