基于事务型K-Anonymity的动态集值属性数据重发布隐私保护方法

研究了动态集值属性数据重发布中的隐私保护问题.真实的数据随时间的推移因插入、删除、修改等操作而产生动态变化.更新后数据的重发布将面临攻击者使用历史发布结果对敏感信息揭露的风险.提出了一种面向动态集值属性数据重发布的隐私保护模型,延续使用事务型k-anonymity原则保护记录间的不可区分性,并通过维持记录中敏感元素在更新过程中的多样性和连续性阻止其被揭露.结合局部重编码泛化和隐匿技术降低数据匿名产生的信息损失,进而提出了完整的重发布算法.通过在真实数据集上进行的实验和比较,研究结果表明提出的方法能有效阻止敏感信息的泄露,并降低发布结果的信息损失.

一种基于K-anonymity模型的数据隐私保护算法

在数据共享的同时,如何保证数据的隐私性是一个重要的问题。泛化方法是数据隐私保护的一种重要方法,但现有的泛化算法不能处理连续属性,数据错误率比较高。在K-anonymity模型基础上,提出了一种扩展泛化算法EGA(Extended Generalization Algorithm),该算法在满足给定K值的条件下,用相对不具体的值最小限度地替换敏感数据,并实现了对离散属性和连续属性的处理。实验结果表明,与现有泛化算法相比,提出的算法具有运行效率高、数据错误率低、能保持敏感数据分类特性等优点。

A Framework for Enhancing Privacy and Anonymity in Blockchain-Enabled IoT Devices

With the increase in IoT(Internet of Things)devices comes an inherent challenge of security.In the world today,privacy is the prime concern of every individual.Preserving one’s privacy and keeping anonymity throughout the system is a desired functionality that does not come without inevitable trade-offs like scalability and increased complexity and is always exceedingly difficult to manage.The challenge is keeping confidentiality and continuing to make the person innominate throughout the system.To address this,we present our proposed architecture where we manage IoT devices using blockchain technology.Our proposed architecture works on and off blockchain integrated with the closed-circuit television(CCTV)security camera fixed at the rental property.In this framework,the CCTV security camera feed is redirected towards the owner and renter based on the smart contract conditions.One entity(owner or renter)can see the CCTV security camera feed at one time.There is no third-party dependence except for the CCTV security camera deployment phase.Our contributions include the proposition of framework architecture,a novel smart contract algorithm,and the modification to the ring signatures leveraging an existing cryptographic technique.Analyses are made based on different systems’security and key management areas.In an empirical study,our proposed algorithm performed better in key generation,proof generation,and verification times.By comparing similar existing schemes,we have shown the proposed architectures’advantages.Until now,we have developed this system for a specific area in the real world.However,this system is scalable and applicable to other areas like healthcare monitoring systems,which is part of our future work.

A Differential Privacy Based (k-Ψ)-Anonymity Method for Trajectory Data Publishing

In recent years,mobile Internet technology and location based services have wide application.Application providers and users have accumulated huge amount of trajectory data.While publishing and analyzing user trajectory data have brought great convenience for people,the disclosure risks of user privacy caused by the trajectory data publishing are also becoming more and more prominent.Traditional k-anonymous trajectory data publishing technologies cannot effectively protect user privacy against attackers with strong background knowledge.For privacy preserving trajectory data publishing,we propose a differential privacy based(k-Ψ)-anonymity method to defend against re-identification and probabilistic inference attack.The proposed method is divided into two phases:in the first phase,a dummy-based(k-Ψ)-anonymous trajectory data publishing algorithm is given,which improves(k-δ)-anonymity by considering changes of thresholdδon different road segments and constructing an adaptive threshold setΨthat takes into account road network information.In the second phase,Laplace noise regarding distance of anonymous locations under differential privacy is used for trajectory perturbation of the anonymous trajectory dataset outputted by the first phase.Experiments on real road network dataset are performed and the results show that the proposed method improves the trajectory indistinguishability and achieves good data utility in condition of preserving user privacy.

Reciprocal Cloaking Algorithm for Spatial K-Anonymity

Mobile devices with global positioning capabilities allow users to retrieve points of interest (POI) in their proximity. Due to the nature of spatial queries, location-based service (LBS) needs the user position in order to process requests. On the other hand, revealing exact user locations to LBS may pinpoint their identities and breach their privacy. Spatial K-anonymity (SKA) exploits the concept of K-anonymity in order to protect the identity of users from location-based attacks. However, existing reciprocal methods rely on a specialized data structure. In contrast, a reciprocal algorithm was proposed using existing spatial index on the user locations. At the same time, an adjusted median splits algorithm was provided. Finally, according to effectiveness (i.e., anonymizing spatial region size) and efficiency (i.e., construction cost), the experimental results verify that the proposed methods have better performance. Moreover, since using employ general-purpose spatial indices, the proposed method supports conventional spatial queries as well.

基于数据流的K-S变化检测的动态多目标规划算法

为了更加准确地判断环境是否发生变化并快速追踪动态多目标规划问题(dynamicmulti-objectiveoptimization problem,DMOP)当前时刻的Pareto前沿,提出了一种基于数据流的Kolmogorov-Smirnov(K-S)变化检测的动态多目标规划(DSK-SDMOP)算法。该算法以NSGA-Ⅱ为基础,通过数据流建立2个时刻的检验窗口,再利用K-S检验基于数据流的Pareto最优前沿是否发生变化,检测2个窗口的数据是否服从同一分布来判断环境是否发生变化,并就环境变化的剧烈程度实行相应的应答机制,以提高对环境的适应程度。利用基于数据流的K-S检测方法,对环境变化不会过于敏感,而且不用提前假设对应目标值的分布,易于操作。通过5个动态多目标规划标准测试函数对该算法进行测试,并和现有的2种算法进行对比分析,结果表明该算法处理动态多目标规划问题具有良好的性能。

一种分配查询的k-匿名位置隐私保护方案

针对基于位置服务中移动终端用户位置隐私保护存在时空关联和背景知识攻击的问题,提出一种分配查询的k-匿名位置隐私保护方案。基于查询概率和欧氏距离,在相邻网格区域内筛选假位置,合并真实用户位置形成k-匿名;通过兴趣点语义四叉树为假位置分配合理的查询,从时间、位置及查询3个维度提升用户被识别的不确定性,从而增强用户隐私度。安全性分析表明,提出的方案满足匿名性、不可伪造性和抵抗查询服务跟踪等安全特性。仿真实验表明,提出的方案具有较高的隐私保护度和效率以及较低的通信开销。

K-S变换及其电网超谐波时频分析应用

依据FFT→优化窗→IFFT思路,突破线性时频变换的窗函数积分性能桎梏,实现高性能优化窗函数的线性时频变换应用,建立新型时频变换算法——K-S变换.对信号x(t)的FFT频谱向量进行频移处理后,与该频移点下Kaiser优化窗的频谱向量进行Hadamard乘积,再将乘积结果进行FFT逆变换(IFFT),构造出K-S变换复时频矩阵,由此获得x(t)的时间-频率-幅值、时间-频率-相位三维信息;给出逆变换的数学推导与局部性质、线性性质和变分辨率特性;0~150 kHz电网的稳态与时变超谐波信号仿真实验表明,K-S变换的时域、频域分辨能力均优于流行的短时傅里叶变换、S变换,具有优良的变分辨率性能;0~40 kHz超谐波信号的实测证明,基于K-S变换的超谐波电压幅值测量绝对误差均小于0.032 3 V.

基于融合K-近邻算法的电压互感器在线监测方法

由于受工作时长和环境因素的影响,电容式电压互感器(capacitor voltage transformer,CVT)在运行过程中误差稳定性不高,易出现电能计量失准现象。为此,该文提出了一种基于融合K-近邻算法(fusion K-nearest neighbor algorithm,FKNN)的电压互感器在线评估方法。该方法利用互感器的历史运行数据构建虚拟标准器,通过改进K-近邻算法对互感器实时状态进行监测,实现对异常情况的报警。同时,提出了一种加权移动时间窗的方法,自适应更新异常阈值,有效削弱电网不平衡波动的影响。实验结果表明,该文方法能够准确监测互感器的0.2级误差漂移。

基于数字孪生与k-近邻算法的车间设备运行状态预测研究

由于传统车间设备运行状态预测不能有效利用历史数据进行学习,实时响应能力有限,难以在复杂调度环境中取得良好效果,因此文章提出一种数字孪生与k-近邻算法相结合的车间设备运行状态预测模型。构建车间设备实体在信息空间的数字孪生模型,并建立设备实体与模型之间的映射关系,从而获取实时特征数据,即设备的运行状态特征数据。运用k-近邻算法计算实时特征数据与历史数据之间的欧几里得距离,即计算设备当前运行状态与历史已知状态的相似度,最终通过前k个距离所对应的设备历史运行状态数据,预测设备的当前运行状态。该模型的本质是通过数字孪生的实时数据采集,获取指定设备运行状态特征数据,运用k-近邻算法预测设备的实时运行状态。相较以往研究,本研究贡献在于提高设备实时运行状态预测的准确率。如果将数字孪生、k-近邻算法与具备自我学习能力的相关算法相结合,模型的预测效果会更好。

面向动态博弈的k-匿名隐私保护数据共享方案

针对训练深度学习模型时,存在缺少大量带标签训练数据和数据隐私泄露等问题,提出了一个面向动态博弈的k-匿名隐私保护数据共享(KPDSDG)方案。首先,引入动态博弈策略设计了最优数据k-匿名方案,在保护数据隐私的同时实现了数据的安全共享。其次,提出了一个数据匿名化评估框架,以匿名数据的可用性、隐私性和信息丢失评估数据匿名化方案,可以进一步提高数据的隐私性和可用性,以降低重新识别的风险。最后,采用条件生成对抗网络生成数据,解决了模型训练缺少大量带标签样本的问题。安全性分析显示,整个共享过程能够保证数据拥有者隐私信息不被泄露。同时实验表明,该方案隐私化后生成的数据训练的模型准确率高于其他方案,最优情况高出8.83%。且与基于原始数据所训练的模型准确率基本一致,最优情况仅相差0.34%。同时该方案具有更低的计算开销。因此该方案同时满足了数据匿名、数据增广和数据安全共享。

试论美国K-12公立学校课程中的种族批判理论之争

近年来,种族批判理论开始走进美国K-12公立学校课程,成为培育学生社会情感能力、维护教育公平的一种路径。然而,伴随种族矛盾加剧和民粹主义抬头,美国社会围绕种族批判理论在K-12公立学校课程中的存废问题展开激烈争论。反对者指责该理论妨害学生的种族身份认知,曲解美国历史,破坏社会共识;支持者则认为该理论能够提升学生多元文化意识,增强种族和历史问题的课堂对话。这场以种族批判理论为核心的课程博弈,反映了当前美国两党在公共教育领域对意识形态主导权的竞争。美国K-12公立学校需要认清既有课程治理措施的缺失,及时清除影响课程设置的认知偏见,进一步拓展具有文化相关性的课程空间。

美国K-12“天才时刻”项目与学生创新素养培养

为建设教育强国,拔尖创新人才受到社会各界高度重视,但我国对拔尖创新人才的关注主要集中在高等教育阶段,对基础教育阶段学生创新素养的关注不足。而美国K-12“天才时刻”项目的核心理念是通过创建探究式的学习活动,培养学生以创造性思维为主的高阶思维技能。“天才时刻”项目的主要做法为:创设自由支持的环境;为学生提供个性化的学习指导;以及引导学生重视项目的反思与自我评价等。研究表明,“天才时刻”项目促进了中小学生创新素养的发展。为培养我国中小学生的创新素养,学校应创建有利于学生创新人格培养的学习氛围;为学生提供个性化的自由发展创新思维的机会;引导学生反思创新实践的过程与自我评价。

To name or not to name？ An overview of the social and ethical issues raised by removing anonymity from sperm donors

The aim of this paper is to focus on the ethical issues raised by the removal of anonymity from sperm donors. The increasing currency of a ＇right to genetic truth＇ is clearly visible in the drive to revise the legislation on donor anonymity in Western and European countries. The ethical debate is polarized between the ＇right to privacy＇ of the donor or parent and the ＇right to know＇ of the prospective child. However, it is evident that religious, social and cultural attitudes have an overarching impact on attitudes towards sperm donation generally and anonymity specifically. In Asian countries, the social and cultural heritage is hugely diverse and different from those of the West. This review considers the research exploring the complexity of ethical issues informing this debate, and argues that parent＇s decisions to reveal donor insemination origins to their children are highly complex and relate to a range of social and cultural attitudes that have not been addressed within the policy to remove anonymity from sperm donors.

K-凸函数的性质

借助集值映射的K-回收映射和K-雅可比映射得到了K-凸函数的两个性质。

基于K-距离拓扑的大规模电子通信信息云存储技术

针对云存储技术在传输或存储过程中信息可能会受到攻击、窃取或丢失的问题,提出基于K-距离拓扑的大规模电子通信信息云存储技术,结合大规模电子通信特征构建云存储系统模型,根据云存储系统特性建立云存储系统拓扑,在拓扑结构的基础上采用经过信息熵优化的K-距离算法选择合适节点数,通过分布式大数据存储技术完成信息云存储。实验结果表明,当占比为75%时,所提方法的恢复成功率降至70%左右,其他2种方法均降为0,开销始终保持在1.25 TB左右,说明该方法能够有效的提高恢复成功率、降低传输开销。

AABN: Anonymity Assessment Model Based on Bayesian Network With Application to Blockchain

Blockchain is a technology that uses community validation to keep synchronized the content of ledgers replicated across multiple users,which is the underlying technology of digital currency like bitcoin.The anonymity of blockchain has caused widespread concern.In this paper,we put forward AABN,an Anonymity Assessment model based on Bayesian Network.Firstly,we investigate and analyze the anonymity assessment techniques,and focus on typical anonymity assessment schemes.Then the related concepts involved in the assessment model are introduced and the model construction process is described in detail.Finally,the anonymity in the MIX anonymous network is quantitatively evaluated using the methods of accurate reasoning and approximate reasoning respectively,and the anonymity assessment experiments under different output strategies of the MIX anonymous network are analyzed.

美国加州K-12族裔研究课程探绎

近年来,美国加州政府开展了一项极具话题性和挑战性的基础教育课程改革,即在K-12阶段推行族裔研究课程。K-12族裔研究课程以批判性种族理论为理论基础,主张通过“反叙事”打破白人对主流课程的叙事控制、文化独裁和知识霸权;超越教育机会与过程平等,力主教育结果平等;揭露、反对教育中的“色盲”现象。为保障K-12族裔研究课程的实施,加州教育厅研制了《族裔研究示范课程》,从目标、原则等方面对课程进行了规范与指导。在加州政府的支持下,K-12族裔研究课程在合法化、制度化的进程中取得了初步成果,但仍面临多方面争议,其发展前景尚不明朗,实际成效仍有待考察。围绕K-12族裔研究课程展开的“大辩论”是美国无休止“文化战争”扩大化的缩影,它折射出当前美国社会的紧张和分裂。

Achieve Personalized Anonymity Through Query Blocks Exchanging

In cyberspace security,the privacy in location-based services(LBSs) becomes more critical. In previous solutions,a trusted third party(TTP) was usually employed to provide disturbance or obfuscation,but it may become the single point of failure or service bottleneck. In order to cope with this drawback,we focus on another important class,establishing anonymous group through short-range communication to achieve k-anonymity with collaborative users. Along with the analysis of existing algorithms,we found users in the group must share the same maximum anonymity degree,and they could not ease the process of preservation in a lower one. To cope with this problem,we proposed a random-QBE algorithm to put up with personalized anonymity in user collaboration algorithms,and this algorithm could preserve both query privacy and location privacy. Then we studied the attacks from passive and active adversaries and used entropy to measure user's privacy level. Finally,experimental evaluations further verify its effectiveness and efficiency.

A New Anonymity Model for Privacy-Preserving Data Publishing

Privacy-preserving data publishing （PPDP） is one of the hot issues in the field of the network security. The existing PPDP technique cannot deal with generality attacks, which explicitly contain the sensitivity attack and the similarity attack. This paper proposes a novel model, （w,γ, k）-anonymity, to avoid generality attacks on both cases of numeric and categorical attributes. We show that the optimal （w, γ, k）-anonymity problem is NP-hard and conduct the Top-down Local recoding （TDL） algorithm to implement the model. Our experiments validate the improvement of our model with real data.