Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2104.05617

Secure and Privacy-Preserving Stored Surveillance Video Sharing atop Permissioned Blockchain

Alem Fitwi·Yu Chen
View original source ↗Read source document ↗Export metadata ↓

Abstract

At present, more than a billion closed-circuit television (CCTV) cameras are watching the world. These cameras garner a lot of visual information that is often processed and stored in remote and centralized cloud servers. Multiple occasions have revealed that this traditional approach is plagued with security and privacy breaches. The breaches could be the interception of raw videos while in transit to distant surveillance analytics centers (SAC), infiltration to cameras and network video records (NVR), or abuse of cameras and stored videos. Hence, the traditional video surveillance system (VSS) cannot guarantee the protection of the privacy of individuals caught on CCTV cameras. Wherefore, this paper proposes a Secure and Privacy-preserving Stored surveillance video sharing (SePriS) mechanism for authorized users/nodes based on smart contracts, blockchain (BC), and the enciphering of video frames using DAB, a mechanism developed based on discrete cosine transform (DCT), advanced encryption standard (AES), and block shuffling (BS) algorithm. The BC-based solution creates an environment auspicious for creating decentralized, reliable SACs and storage sites with secure and privacy-aware sharing of stored surveillance videos across SAC nodes and by law enforcers, police departments, and courts securely connected to the SAC nodes. The experiments and analyses validate that the proposed BC-based SePriS solution achieves the design purpose.

Explore related subjects

cs.DC

Keep this discovery

BibTeXRIS

Alem Fitwi, Yu Chen. 2021-04-12. Secure and Privacy-Preserving Stored Surveillance Video Sharing atop Permissioned Blockchain. https://arxiv.org/abs/2104.05617

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC↗
arXiv2026

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC↗
arXiv2026

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC↗