The digital rights management (DRM) techniques are very important in the fields of multimedia security. The major areas of multimedia data security includes secrecy, ownership protection and traitor tracing. Even though, a number of encryption techniques were developed for multimedia encryption, most of them are vulnerable to several types of attacks. Hence, an encryption system having better s...

We investigate the notion of history preserving bisimulation [15, 18, 3] for contextual P/T nets, a generalization of ordinary P/T Petri nets where a transition may check for the presence of tokens without consuming them (non-destructive read operations). A first equivalence, simply called HP-bisimulation, is based on Winskel’s prime event structures. A finer equivalence, called RHP-bisimulatio...

Prior knowledge can be introduced into system identiication problems in terms of constraints on the parameter space, or regularizing penalty functions in a prediction error criterion. The contribution of this work is mainly an extention of the well known FPE (Final Prediction Error) statistic to the case when the system identiication problem is constrainted and contains a regularization penalty...

In recent years, blockchain and machine-learning techniques have received increasing attention both in theoretical practical aspects. However, the applications of these many challenges, one which is privacy-preserving issue. this paper, we focus on, specifically, issue imbalanced datasets, a commonly found problem real-world applications. Built based on fully homomorphic encryption technique, p...

We study the problem of constructing a block-cipher on a “possibly-strange” set S using a block-cipher on a larger set T . Such constructions are useful in format-preserving encryption, where for example the set S might contain “valid 9-digit social security numbers” while T might be the set of 30-bit strings. Previous work has solved this problem using a technique called cycle walking, first f...

Background. A scheme for format-preserving encryption (FPE) is supposed to do that which a conventional (possibly tweakable) blockcipher does—encipher messages within some message space X—except that message space, instead of being something like X = {0, 1}128, is more general [1, 3]. For example, the message space might be the set X = {0, 1, . . . , 9}16, in which case each 16-digit plaintext ...

Format Preserving Encryption (FPE) schemes encrypt a plaintext into a ciphertext while preserving its format (e.g., a valid social-security number is encrypted into a valid social-security number), thus allowing encrypted data to be stored and used in the same manner as unencrypted data. Motivated by the always-increasing use of cloud-computing and memory delegation, which require preserving bo...

Computational notions of entropy have recently found many applications, including leakageresilient cryptography, deterministic encryption or memory delegation. The two main types of results which make computational notions so useful are (1) Chain rules, which quantify by how much the computational entropy of a variable decreases if conditioned on some other variable (2) Transformations, which q...

The arrival of cloud computing the new pattern for data outsourcing and high quality data service is great flexibility and economic saving. However fear about the sensitive information on cloud to be protecting the data privacy problems sensitive information has to be encrypted before outsourcing, which creates the effective data utilization services a very big challenging task. Symmetric Searc...