1. Function S-rough sets and security-authentication of hiding law
- Author
-
KaiQuan Shi and Jianli Zhao
- Subjects
Discrete mathematics ,Authentication ,General Computer Science ,Bar (music) ,ComputingMilieux_LEGALASPECTSOFCOMPUTING ,Information security ,Function (mathematics) ,Equivalence class (music) ,Elliptic curve ,Law ,Computer Science::Multimedia ,Information system ,Rough set ,Computer Science::Cryptography and Security ,Mathematics - Abstract
Function S-rough sets are defined by R-function equivalence class, which have dynamic characteristic. Function S-rough sets have dynamic characteristic, law characteristic and law-hiding characteristic. Function S-rough sets can generate f-hiding law and $$ \bar f $$ -hiding law. By engrafting, crossing, and penetrating between the information security theory and function S-rough sets, the security hiding and the authentication of f-hiding law and $$ \bar f $$ -hiding law are given respectively in this paper. The fusion and share between function S-rough sets and information security theory is a new research direction of the application of information law in information system.
- Published
- 2008