提出一种基于角色的透明计算应用权限控制模型TCACM(Transparent computing access control model).该模型能够较好地解决透明计算中的系统安全性问题.该模型由客户端和服务器端两部分组成.客户端启动应用程序,计算出应用程序的数据指纹...提出一种基于角色的透明计算应用权限控制模型TCACM(Transparent computing access control model).该模型能够较好地解决透明计算中的系统安全性问题.该模型由客户端和服务器端两部分组成.客户端启动应用程序,计算出应用程序的数据指纹,将其与服务器端"安全应用程序"数据库匹配,进行完整性验证;根据授权角色权限集进行授权验证,由验证结果动态地管理用户可运行应用程序集.实验结果验证了该模型的可行性.展开更多
As the risk of malware is sharply increasing in Android platform,Android malware detection has become an important research topic.Existing works have demonstrated that required permissions of Android applications are ...As the risk of malware is sharply increasing in Android platform,Android malware detection has become an important research topic.Existing works have demonstrated that required permissions of Android applications are valuable for malware analysis,but how to exploit those permission patterns for malware detection remains an open issue.In this paper,we introduce the contrasting permission patterns to characterize the essential differences between malwares and clean applications from the permission aspect Then a framework based on contrasting permission patterns is presented for Android malware detection.According to the proposed framework,an ensemble classifier,Enclamald,is further developed to detect whether an application is potentially malicious.Every contrasting permission pattern is acting as a weak classifier in Enclamald,and the weighted predictions of involved weak classifiers are aggregated to the final result.Experiments on real-world applications validate that the proposed Enclamald classifier outperforms commonly used classifiers for Android Malware Detection.展开更多
The necessary and sufficient conditions under which a ring satisfies regular power-substitution are investigated. It is shown that a ring R satisfies regular powersubstitution if and only if a-b in R implies that ther...The necessary and sufficient conditions under which a ring satisfies regular power-substitution are investigated. It is shown that a ring R satisfies regular powersubstitution if and only if a-b in R implies that there exist n ∈ N and a U E GLn （R） such that aU = Ub if and only if for any regular x ∈ R there exist m,n ∈ N and U ∈ GLn（R） such that x^mIn = xmUx^m, where a-b means that there exists x,y, z∈ R such that a =ybx, b = xaz and x= xyx = xzx. It is proved that every directly finite simple ring satisfies regular power-substitution. Some applications for stably free R-modules are also obtained.展开更多
文摘提出一种基于角色的透明计算应用权限控制模型TCACM(Transparent computing access control model).该模型能够较好地解决透明计算中的系统安全性问题.该模型由客户端和服务器端两部分组成.客户端启动应用程序,计算出应用程序的数据指纹,将其与服务器端"安全应用程序"数据库匹配,进行完整性验证;根据授权角色权限集进行授权验证,由验证结果动态地管理用户可运行应用程序集.实验结果验证了该模型的可行性.
基金This work was supported by Deakin Cyber Security Research Cluster National Natural Science Foundation of China under Grant Nos. 61304067 and 61202211 +1 种基金 Guangxi Key Laboratory of Trusted Software No. kx201325 the Fundamental Research Funds for the Central Universities under Grant No 31541311314.
文摘As the risk of malware is sharply increasing in Android platform,Android malware detection has become an important research topic.Existing works have demonstrated that required permissions of Android applications are valuable for malware analysis,but how to exploit those permission patterns for malware detection remains an open issue.In this paper,we introduce the contrasting permission patterns to characterize the essential differences between malwares and clean applications from the permission aspect Then a framework based on contrasting permission patterns is presented for Android malware detection.According to the proposed framework,an ensemble classifier,Enclamald,is further developed to detect whether an application is potentially malicious.Every contrasting permission pattern is acting as a weak classifier in Enclamald,and the weighted predictions of involved weak classifiers are aggregated to the final result.Experiments on real-world applications validate that the proposed Enclamald classifier outperforms commonly used classifiers for Android Malware Detection.
基金supported by the grant of Hangzhou Normal University (No.200901).
文摘The necessary and sufficient conditions under which a ring satisfies regular power-substitution are investigated. It is shown that a ring R satisfies regular powersubstitution if and only if a-b in R implies that there exist n ∈ N and a U E GLn （R） such that aU = Ub if and only if for any regular x ∈ R there exist m,n ∈ N and U ∈ GLn（R） such that x^mIn = xmUx^m, where a-b means that there exists x,y, z∈ R such that a =ybx, b = xaz and x= xyx = xzx. It is proved that every directly finite simple ring satisfies regular power-substitution. Some applications for stably free R-modules are also obtained.
