A bound on correlation immunity.
A comparative study of microaggregation methods.
Microaggregation is a statistical disclosure control technique for microdata. Raw microdata (i.e. individual records) are grouped into small aggregates prior to publication. Each aggregate should contain at least k records to prevent disclosure of individual information. Fixed-size microaggregation consists of taking fixed-size microaggregates (size k). Data-oriented microaggregation (with variable group size) was introduced recently. Regardless of the group size, microaggregations on a multidimensional...
A computational perspective on network coding.
A new lightweight method for security risk assessment based on fuzzy cognitive maps
A new method for web site protection and compression.
An algebraic approach to fix points of GOST-algorithm
An angent based approach to modeling the secure electronic transaction protocol.
An application of algebraic geometry to encryption: tame transformation method.
Chaotic image encryption design using Tompkins-Paige algorithm.
Characterisations of ideal threshold schemes.
Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery
An important task of knowledge discovery deals with discovering association rules. This very general model has been widely studied and efficient algorithms have been proposed. But most of the time, only frequent rules are seeked. Here we propose to consider this problem as a multi-objective combinatorial optimization problem in order to be able to also find non frequent but interesting rules. As the search space may be very large, a discussion about different approaches is proposed and a hybrid...
Cryptography through Interpolation, Approximation and Computational Intelligence methods
Cryptographycal protocols in the Egerfood Information System.
Encryption schemes using finite frames and Hadamard arrays.
Formalization of the Advanced Encryption Standard. Part I
In this article, we formalize the Advanced Encryption Standard (AES). AES, which is the most widely used symmetric cryptosystem in the world, is a block cipher that was selected by the National Institute of Standards and Technology (NIST) as an official Federal Information Processing Standard for the United States in 2001 [12]. AES is the successor to DES [13], which was formerly the most widely used symmetric cryptosystem in the world. We formalize the AES algorithm according to [12]. We then verify...
Mathematical foundation of digital signatures.
Privacy homomorphisms for statistical confidentiality.
When publishing contingency tables which contain official statistics, a need to preserve statistical confidentiality arises. Statistical disclosure of individual units must be prevented. There is a wide choice of techniques to achieve this anonymization: cell supression, cell perturbation, etc. In this paper, we tackle the problem of using anonymized data to compute exact statistics; our approach is based on privacy homomorphisms, which are encryption transformations such that the decryption of...
Recent Advances in Stream Cipher Cryptanalysis
Remarks concerning RSA-cryptosystem exponents
Secure two-way on-line communication by using quasigroup enciphering with almost public key.