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

Optimization Problems01:26

Optimization Problems

8
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
8
Censoring Survival Data01:09

Censoring Survival Data

518
Survival analysis is a statistical method used to analyze time-to-event data, often employed in fields such as medicine, engineering, and social sciences. One of the key challenges in survival analysis is dealing with incomplete data, a phenomenon known as "censoring." Censoring occurs when the event of interest (such as death, relapse, or system failure) has not occurred for some individuals by the end of the study period or is otherwise unobservable, and it might have many different...
518
Law of Independent Assortment02:03

Law of Independent Assortment

62.2K
While Mendel’s Law of Segregation states that the two alleles for one gene are separated into different gametes, a different question of how different genes are inherited remains. For example, is the gene for tall plants inherited with the gene for green peas? Mendel asked this question by experimenting with a dihybrid cross; a cross in which both parents are homozygous for two distinct traits resulting in an F1 generation that are heterozygous for both traits.
62.2K
Norton's Theorem01:14

Norton's Theorem

1.4K
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.4K
Combinatorial Gene Control02:33

Combinatorial Gene Control

9.5K
Combinatorial gene control is the synergistic action of several transcriptional factors to regulate the expression of a single gene. The absence of one or more of these factors may lead to a significant difference in the level of gene expression or repression.
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
9.5K
Conservative Site-specific Recombination and Phase Variation02:53

Conservative Site-specific Recombination and Phase Variation

6.6K
Because the DNA segments are cut and reorganized in a direction-specific manner, site-specific recombination has emerged as an efficient genetic engineering technique. Flippase and Cyclization recombinases or Flp and Cre, respectively, are two members of the tyrosine recombinase family derived from bacteriophages, that are used to mediate site-specific DNA insertions, deletions, and targeted expression of proteins in mammalian cell lines.
The recognition sites for Cre recombinase called LoxP...
6.6K

You might also read

Related Articles

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

Sort by
Same author

Multi-User PIR with Cyclic Wraparound Multi-Access Caches.

Entropy (Basel, Switzerland)·2023
Same author

Generalized Index Coding Problem and Discrete Polymatroids.

Entropy (Basel, Switzerland)·2020
Same author

Optimal Linear Error Correcting Delivery Schemes for Two Optimal Coded Caching Schemes.

Entropy (Basel, Switzerland)·2020
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
See all related articles

Related Experiment Video

Updated: Jan 13, 2026

Microfluidic Platform with Multiplexed Electronic Detection for Spatial Tracking of Particles
11:54

Microfluidic Platform with Multiplexed Electronic Detection for Spatial Tracking of Particles

Published on: March 13, 2017

9.8K

Security, Privacy, and Linear Function Retrieval in Combinatorial Multi-Access Coded Caching with Private Caches.

Mallikharjuna Chinnapadamala1, B Sundar Rajan1

  • 1Department of Electrical Communication Engineering, IISc, Bengaluru 560012, India.

Entropy (Basel, Switzerland)
|October 28, 2025
PubMed
Summary
This summary is machine-generated.

This study introduces a coded caching scheme with private caches, enhancing data security and user privacy. The new approach uses less memory than existing methods while ensuring linear function retrieval.

Keywords:
coded cachinglinear function retrievalmulti-accessprivacysecurity

More Related Videos

Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

18.1K

Related Experiment Videos

Last Updated: Jan 13, 2026

Microfluidic Platform with Multiplexed Electronic Detection for Spatial Tracking of Particles
11:54

Microfluidic Platform with Multiplexed Electronic Detection for Spatial Tracking of Particles

Published on: March 13, 2017

9.8K
Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

18.1K

Area of Science:

  • Information theory
  • Computer engineering
  • Network security

Background:

  • Coded caching systems aim to reduce data retrieval costs by caching content at user nodes.
  • Existing multi-access combinatorial caching lacks robust privacy and security features.
  • The integration of private caches alongside multi-access caches presents a novel architectural approach.

Purpose of the Study:

  • To develop a coded caching scheme that simultaneously ensures Linear Function Retrieval (LFR), content security, and demand privacy.
  • To leverage private caches to enhance user privacy against colluding users.
  • To improve memory efficiency compared to existing multi-access combinatorial caching schemes.

Main Methods:

  • A novel coded caching scheme integrating private and multi-access caches is proposed.
  • Security and privacy guarantees are formally analyzed.
  • A cut-set lower bound is derived to evaluate the scheme's performance.
  • The scheme is extended to a generalized user-cache connectivity model.

Main Results:

  • The proposed scheme achieves Linear Function Retrieval (LFR), content security, and demand privacy.
  • Private caches are demonstrated to be effective in providing privacy against colluding users.
  • The scheme offers reduced total user memory access and system memory compared to prior art for the same data rate.
  • Optimality is proven for r≥C-1, with a constant gap of 5 shown for r

Conclusions:

  • The novel coded caching scheme effectively balances performance, security, and privacy.
  • The inclusion of private caches significantly enhances demand privacy in multi-access systems.
  • The scheme presents a more memory-efficient solution for coded caching in combinatorial topologies.