New precisely cooperative attacks, such as the coordi- nated cross plane session termination （CXPST） attack, need thou- sands upon thousands machines to attack diverse selected links simultaneously with the given ra...New precisely cooperative attacks, such as the coordi- nated cross plane session termination （CXPST） attack, need thou- sands upon thousands machines to attack diverse selected links simultaneously with the given rate. However, almost all command and control（C＆C） mechanisms only provide publishing one com- mand to the whole once, so-called one-to-all C＆C model, and are not productive to support CXPST-alike attacks. In this paper, we present one-to-any C＆C model on coordination among the unco- operative controlled nodes. As an instance of one-to-any C＆C model, directional command publishing （DCP） mechanism lever- aging on Kademlia is provided with a range-mapping key creating algorithm for commands to compute the publishing range and a statistically stochastic node querying scheme to obtain the com- mands immediately. With theoretical analysis and simulation, it is indicated that one-to-any C＆C model fits for precisely coordi- nated operation on uncooperative controlled nodes with least complexity, better accuracy and efficiency. Furthermore, DCP mechanism can support one-to-all command publishing at the same time. As an example of future C＆C model, studying on one-to-any C＆C model may help to promote the development of more efficient countermeasures.展开更多
协同过滤推荐是当前最成功的个性化推荐技术之一,但是传统的协同过滤推荐算法普遍存在推荐性能低和抗攻击能力弱的问题.针对以上问题,提出了一种基于多元化社交信任的协同过滤推荐算法CF-CRIS(collaborative filtering based on credibi...协同过滤推荐是当前最成功的个性化推荐技术之一,但是传统的协同过滤推荐算法普遍存在推荐性能低和抗攻击能力弱的问题.针对以上问题,提出了一种基于多元化社交信任的协同过滤推荐算法CF-CRIS(collaborative filtering based on credibility,reliability,intimacy and self-orientation).1)借鉴社会心理学中的信任产生原理,提出基于多个信任要素(可信度、可靠度、亲密度、自我意识导向)的信任度计算方法;2)深入研究社交网络环境中各信任要素的识别、提取和量化方法;3)基于用户间的综合信任度选取可信邻居,完成对目标用户的个性化推荐.基于通用测试数据集的实验研究结果表明:该算法不但可以极大地提高推荐系统的精确度和召回率,而且表现出良好的抗攻击能力.展开更多
基金Supported by the National Natural Science Foundation of China(61402526,61502528)
文摘New precisely cooperative attacks, such as the coordi- nated cross plane session termination （CXPST） attack, need thou- sands upon thousands machines to attack diverse selected links simultaneously with the given rate. However, almost all command and control（C＆C） mechanisms only provide publishing one com- mand to the whole once, so-called one-to-all C＆C model, and are not productive to support CXPST-alike attacks. In this paper, we present one-to-any C＆C model on coordination among the unco- operative controlled nodes. As an instance of one-to-any C＆C model, directional command publishing （DCP） mechanism lever- aging on Kademlia is provided with a range-mapping key creating algorithm for commands to compute the publishing range and a statistically stochastic node querying scheme to obtain the com- mands immediately. With theoretical analysis and simulation, it is indicated that one-to-any C＆C model fits for precisely coordi- nated operation on uncooperative controlled nodes with least complexity, better accuracy and efficiency. Furthermore, DCP mechanism can support one-to-all command publishing at the same time. As an example of future C＆C model, studying on one-to-any C＆C model may help to promote the development of more efficient countermeasures.
文摘协同过滤推荐是当前最成功的个性化推荐技术之一,但是传统的协同过滤推荐算法普遍存在推荐性能低和抗攻击能力弱的问题.针对以上问题,提出了一种基于多元化社交信任的协同过滤推荐算法CF-CRIS(collaborative filtering based on credibility,reliability,intimacy and self-orientation).1)借鉴社会心理学中的信任产生原理,提出基于多个信任要素(可信度、可靠度、亲密度、自我意识导向)的信任度计算方法;2)深入研究社交网络环境中各信任要素的识别、提取和量化方法;3)基于用户间的综合信任度选取可信邻居,完成对目标用户的个性化推荐.基于通用测试数据集的实验研究结果表明:该算法不但可以极大地提高推荐系统的精确度和召回率,而且表现出良好的抗攻击能力.
