ID 原文 译文
1443 并利用变换簇中两种特殊分组密码结构的线性逼近之间的关系，给出了变换簇中所有密码结构抵抗线性密码分析的安全性评估结果，并提出了需要进一步探讨的若干问题。 Using the relation betweenlinear approximations of two special block cipher structures, security evaluation against linear crypt analysis for all block ci-pher structures of the cluster is given. Moreover, some open problems are given.
1444 这种利用变换簇对分组密码进行研究的方法，为分组密码的安全性评估提供了一个较为新颖的思路。 We provide a novel idea for the security e-valuation of block ciphers by using transform cluster to study block ciphers.
1445 如何在轨迹数据发布时保护用户隐私信息并且最大程度地减少数据损失是隐私保护研究领域的一个重要课题。 How to preserve users'privacy information and minimize the loss of information when publishing trajecto-ry data has become an important topic in the research field of privacy preservation.
1446 本文提出一种基于单点收益的轨迹隐私保护方法，在满足用户隐私要求的情况下，根据收益计算结果，在轨迹数据集中抑制位置点或者添加假轨迹，保证每次处理轨迹数据集时能达到最大收益，从而减少信息损失。 In this paper, we propose a trajectory pri-vacy-preserving method based on single point gain, which satisfies the privacy requirements of users. According to the singlepoint gain values, we suppress location points or add dummy trajectories into the trajectory dataset to ensure that the maxi-mum benefit can be achieved at each iteration, thus reducing the loss of information.
1447 理论分析和实验结果表明，在隐私容忍度要求较高或者攻击者数量较多的情况下，本文方法能在保证隐私保护强度前提下有效降低数据损失率。 Theoretical analysis and experimental results show that, in the case of high privacy tolerance or a large number of attackers, the proposed method effectively re-duces the information loss rate while guaranteeing the intensity of privacy preserving.
1448 本文研究了无线携能通信网络中的多窃听者场景下，基于无线能量收集放大转发中继的协作机密信息安全传输问题。 We research on cooperative information security transmitting using energy harvest amplify-and-forward re-lay in the wireless information and power transfer network with multiple eavesdroppers.
1449 提出了两种低复杂度的零空间波束形成方案。 Two low-complexity methods usingzero-space beaforming technique are proposed.
1450 分别利用接收者或窃听者方位先验信息，将待优化的目标矢量投射到接收者或窃听者信道的零空间。 Using the prior location information of receiver or eavesdroppers, our meth-ods project the target vector to the zero space of receiver or eavesdroppers.
1451 与原协作波束形成方法相比，由于降低了待优化目标矢量的空间自由度，本文方法运算复杂度较低。 Computational complexity of the method is lower than that of classical method since space freedom of the target vector is reduced.
1452 特别的，由于第二种方法目标函数中将窃听者的交互信息迫零，将原始拟凸优化问题转化为凸问题求解，进一步降低了运算量。 Furthermore, second method induces theeavesdropper's mutual information of objective function to be zero, the original quasi-convex problem is transformed into aconvex form. Thus, computational complexity of the method is apparently reduced compared with that of classical method.