基于SPIN的网络认证协议高效模型检测

为了有效地提高网络认证协议建模和验证的效率,基于模型检测方法提出一个通用的网络认证协议模型描述方法,结合模型检测工具SPIN可以方便地进行性质验证。通过一些模型的简化策略,不仅可以对不同协议进行高效建模,而且减小了模型的状态空间。与现有的文献相比,自动化程度较高,模型验证的效率较好。基于该方法,对PKM认证协议进行了模型检测,实验证明该模型分析验证方法的有效性,可用于其他网络认证协议的分析验证。     

基于动态调整节点包发送速率的基站保护策略

无线传感器网络中,为了抵御全局流量监测的攻击者,提出了一种基于节点包发送速率动态调整的基站位置隐私保护策略SRA。SRA通过调整全网节点的发包率,实现源节点到基站的流量隐藏,继而能够有效抵御全局流量分析的攻击者。理论表明,SRA能够有抵御全局流量的攻击者对基站的定位。更进一步地,提出了基于贪心选择路径的基站位置隐私保护策略GCR,进一步降低网络通信开销。实验表明,与SRA相比,GCR能够有效保护基站的位置隐私且具有较低的通信开销。     

无线局域网及其安全机制

由于无线局域网采用的无线信道的特殊性 ,相对于有线 L AN来说 ,WL AN中就必须采取有效的安全措施。本文在论述无线局域网的特点的基础上 ,重点论述了无线局域网的接入控制和保密     

Ethics-based training for nonclinical staff in mental health settings.

Under the Ethics Code of the American Psychological Association (2002), psychologists are responsible for ensuring that delegated tasks are performed competently. For staff members who interact with clients or who have access to confidential client information, technical competence may not suffice. Psychologists who want to provide the best protection for clients can offer staff training that fosters “ethical competence” as well. Setting-specific ethics training is important even for personnel who have previously worked in other mental health sites, because it demonstrates how the profession’s ethical standards will be upheld through specific policies in the current setting. From an ethical perspective, staff training is not an end in itself or a risk-management strategy for protecting psychologists; rather, it is a means of protecting clients and their rights. The goal is to create a culture of safety (S. J. Knapp & L. D. VandeCreek, 2006) in which upholding ethical standards becomes everyone’s shared responsibility. This ethics-based training would be appropriate for nonclinical staff, clinical staff, supervisees, and students. It can be adapted to outpatient, inpatient, research, or academic clinic settings. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

LBS系统的私密性研究

定位服务的关键在于对用户位置信息的使用,而位置信息与个人隐私密切相关,为了防止位置信息的滥用,定位系统需要充分考虑用户的私密性保护。论文针对不同类型的业务分析了私密性保护的需求,并根据定位系统的体系结构提出了私密性保护的必要方面,最后结合定位流程描述了私密性控制的实现。     

Attacks and improvements on the RFID authentication protocols based on matrix

Most of the Radio Frequency IDentification (RFID) authentication protocols, proposed to preserve security and privacy, are analysed to show that they can not provide security against some passive or active attacks. In this paper, the security of two matrix-based protocols, proposed by Karthikeyan and Nesterenko (KN protocol) and Ramachandra et al. (RRS protocol) that conform to Electronic Product Code Class-1 Generation-2 (EPC Class-1 Gen-2) standard, are investigated. Using the linear relationship of multiplication of matrix and vector, we point out that both protocols can not provide scalability, and they are vulnerable to passive impersonation attack. In addition, both protocols are totally insecure if the adversary can compromise one tag to extract the secrets. A modified lightweight matrix-based authentication protocol is presented, which can resist mainly common attacks on an RFID authentication system including eavesdropping, relay attack, desynchronization attack, impersonation attack and tag tracking attack. The new protocol also has the desirable scalability property and can keep secure under compromising attack.     

FRAPP: a framework for high-accuracy privacy-preserving mining

To preserve client privacy in the data mining process, a variety of techniques based on random perturbation of individual data records have been proposed recently. In this paper, we present FRAPP, a generalized matrix-theoretic framework of random perturbation, which facilitates a systematic approach to the design of perturbation mechanisms for privacy-preserving mining. Specifically, FRAPP is used to demonstrate that (a) the prior techniques differ only in their choices for the perturbation matrix elements, and (b) a symmetric positive-definite perturbation matrix with minimal condition number can be identified, substantially enhancing the accuracy even under strict privacy requirements. We also propose a novel perturbation mechanism wherein the matrix elements are themselves characterized as random variables, and demonstrate that this feature provides significant improvements in privacy at only a marginal reduction in accuracy. The quantitative utility of FRAPP, which is a general-purpose random-perturbation-based privacy-preserving mining technique, is evaluated specifically with regard to association and classification rule mining on a variety of real datasets. Our experimental results indicate that, for a given privacy requirement, either substantially lower modeling errors are incurred as compared to the prior techniques, or the errors are comparable to those of direct mining on the true database. A partial and preliminary version of this paper appeared in the Proc. of the 21st IEEE Intl. Conf. on Data Engineering (ICDE), Tokyo, Japan, 2005, pgs. 193–204.     

Ethics is fragile,goodness is not

This paper first illustrates what kind of ethical issues arise from the new information, communication and automation technology. It then argues that we may embrace the popular idea that technology is ethically neutral or even ambivalent without having to close our eyes to those issues and in fact, that the ethical neutrality of technology makes them all the more urgent. Finally, it suggests that the widely ignored fact of normal responsible behaviour offers a new and fruitful starting point for any future thinking about such issues.     

基于隐私保护的序列模式挖掘

隐私保护是当前数据挖掘领域的一个研究热点,其目标是在不暴露原始数据信息的前提下准确地实现挖掘任务。针对隐私保护序列模式挖掘问题,提出了项集的布尔集合关系概念,设计了基于随机集和扰乱函数对原始序列库进行数据干扰的方法模型,并通过扰乱函数的特性还原出原始序列库的频繁序列模式的真实支持度,完成了在保护原始数据隐私的前提下准确地挖掘出频繁序列模式的任务。理论分析和实验结果表明,该方法模型具有很好的数据隐私保护性、挖掘结果准确性和算法执行高效性。