首页 | 本学科首页   官方微博 | 高级检索  
     


Function S-rough sets and security-authentication of hiding law
Authors:KaiQuan Shi  JianLi Zhao
Affiliation:(1) School of Mathematics and Computer Sciences, Longyan University, Longyan, 364000, China;(2) School of Mathematics and System Sciences, Shandong University, Jinan, 250100, China;(3) School of Mathematics Science, Liaocheng University, Liaocheng, 252059, China
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. Supported by the National Natural Science Foundation of China (Grant No. 10771073) and the Natural Science Foundation of Shandong Province (Grant No. Y2004A04)
Keywords:function S-rough sets  law-hiding  elliptic curve  the security-authentication of hiding law
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号