Related papers: Encryption dynamics and avalanche parameter for "d…
This paper revisits the ordered statistics decoding (OSD). It provides a comprehensive analysis of the OSD algorithm by characterizing the statistical properties, evolution and the distribution of the Hamming distance and weighted Hamming…
Dynamic Searchable Encryption (DSE) has emerged as a solution to efficiently handle and protect large-scale data storage in encrypted databases (EDBs). Volume leakage poses a significant threat, as it enables adversaries to reconstruct…
In this paper, we present a comprehensive architecture for confidential computing, which we show to be general purpose and quite efficient. It executes the application as is, without any added burden or discipline requirements from the…
A method for optimizing encryption mechanism and resource allocation based on edge computing environment is proposed. A local differential privacy algorithm based on a histogram algorithm is used to protect user information during task…
Decentralized stochastic optimization is the basic building block of modern collaborative machine learning, distributed estimation and control, and large-scale sensing. Since involved data usually contain sensitive information like user…
This paper presents a reversible data hiding in encrypted image (RDHEI), which divides image into non-overlapping blocks. In each block, central pixel of the block is considered as leader pixel and others as follower ones. The prediction…
Emerging applications of blockchains, such as grocery supply chains, require frequent updates to the data structure. This is in contrast with typical analyses of the Bitcoin blockchain, in which updates occur infrequently. With more…
In this paper, a streaming transmission setup is considered where an encoder observes a new message in the beginning of each block and a decoder sequentially decodes each message after a delay of $T$ blocks. In this streaming setup, the…
The expectation-maximization (EM) algorithm is a well-known iterative method for computing maximum likelihood estimates from incomplete data. Despite its numerous advantages, a main drawback of the EM algorithm is its frequently observed…
We have formerly introduced Deep Random Secrecy, a new cryptologic technique capable to ensure secrecy as close as desired from perfection against unlimited passive eavesdropping opponents. We have also formerly introduced an extended…
Data-driven methodologies are nowadays ubiquitous. Their rapid development and spread have led to applications even beyond the traditional fields of science. As far as dynamical systems and differential equations are concerned, neural…
Safe operation of systems such as robots requires them to plan and execute trajectories subject to safety constraints. When those systems are subject to uncertainties in their dynamics, it is challenging to ensure that the constraints are…
Lately, multimedia encryption has been the focus of attention in many researches. Recently, a large number of encryption algorithms has been presented to protect image contents.The main objective of modern image encryption schemes is to…
This paper proposes a random network model for blockchains, a distributed hierarchical data structure of blocks that has found several applications in various industries. The model is parametric on two probability distribution functions…
In recent years, the infinite time-evolution block decimation (iTEBD) method has been demonstrated to be one of the most efficient and powerful numerical schemes for time-evolution in one-dimensional quantum many-body systems. However, a…
Distributed locking mechanisms are fundamental to ensuring data consistency and integrity in distributed systems. This paper presents a comprehensive analysis of distributed locking algorithms, focusing on their performance characteristics…
We have introduced a mechanism for synchronizing chaotic systems by one way coupling with a variable delay that is reset at finite intervals. Here we extend this method to time delay systems and suggest a new cryptosystem based on this. We…
The state-of-the-art error correcting codes are based on large random constructions (random graphs, random permutations, ...) and are decoded by linear-time iterative algorithms. Because of these features, they are remarkable examples of…
Password authentication is a weak point for security as passwords are easily stolen and a user may ignore the security by using a simple password. Therefore, services increasingly demand a second factor. While this may enhance security, it…
Large-scale applications of energy density functional (EDF) methods depend on fast and reliable algorithms to solve the associated non-linear self-consistency problem. When dealing with large single-particle variational spaces, existing…