Faithful quantum entanglement sharing based on linear optics with additional qubits

This paper presents a scheme for faithfully distributing a pure entanglement between two parties over an arbitrary collective-noise channel with linear optics. The transmission is assisted by an additional qubit against collective noise. The receiver can take advantage of the time discrimination and the measurement results of the assistant qubit to reconstruct a pure entanglement with the sender. Although the scheme succeeds probabilistically, the resource used to get a pure entanglement state is finite, and so is easier to establish entanglement in practice than quantum entanglement purification.

NEW SECRET SHARING SCHEME BASED ON LINEAR CODE

A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.

基于共享近邻加权局部线性嵌入的轴承故障诊断

针对传统局部线性嵌入算法在挖掘局部流形结构时未充分考虑样本邻居分布信息,且在降维过程中默认样本具有相同的重要性导致提取鉴别特征不明显的问题,提出基于共享近邻的加权局部线性嵌入(weighted local linear embedding based on shared neighbors,SN-WLLE)算法,并用于滚动轴承故障诊断.该算法首先使用余弦距离划分样本邻域;其次计算样本邻域对相似度用以评估样本共享近邻信息,并结合样本的6种邻居分布修正局部结构挖掘,提高多共享近邻的k近邻重构准确性;接着从多流形的角度评估样本点与近邻点间的稀疏分布一致性,以获得样本的重要性指标,并在低维空间保持该信息,进而提取准确的鉴别特征;最后结合KNN分类器构建出完备的轴承故障诊断模型.采用凯斯西储大学轴承数据集和实验室测试平台轴承数据集,从可视化评估、定量聚类评估、故障识别精度评估及鲁棒性评估等方面进行分析.结果表明:SN-WLLE算法的F值保持在108以上水准,平均故障识别精度最低可达0.9734,不仅具有较好的类内紧致性与类间可分性,还对近邻参数k具有低敏感性.

Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services

Cloud-based services have powerful storage functions and can provide accurate computation.However,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight.Although the attribute-based proxy re-encryption(ABPRE)schemes based on number theory can solve this problem,it is still difficult to resist quantum attacks and have limited expression capabilities.To address these issues,we present a novel linear secret sharing schemes(LSSS)matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research.Additionally,to detect the activities of illegal proxies,homomorphic signature(HS)technology is introduced to realize the verifiability of re-encryption.Moreover,the non-interactivity,unidirectionality,proxy transparency,multi-use,and anti-quantum attack characteristics of our system are all advantageous.Besides,it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud.Furthermore,under the standard model,the proposed learning with errors(LWE)-based scheme was proven to be IND-sCPA secure.

基于换电的共享电动汽车调度与服务定价

为解决共享电动汽车出行模式车辆失衡与电能补给问题,基于集充统配换电模式,考虑共享电动汽车电能补给、换电站选址与电池配送路径间的耦合关系,基于时空网络构建以最大化利润为目标的共享电动汽车调度与服务定价优化模型,并通过共享电动汽车需求-价格函数逆变换,将非线性非凸模型转换成更易求解的非线性凸模型。数值试验结果表明:协同决策换电站位置、电池配送路径、共享电动汽车调度方案与服务价格,可提高共享电动汽车出行服务商利润;基于割线的外逼近算法比基于切线的外逼近算法和拉格朗日松弛算法更适于求解所提出的模型。参数敏感度分析结果显示,潜在共享电动汽车出行需求与电能可得性都是影响共享电动汽车出行服务商利润的重要因素。

联盟链下的高效车联网数据安全共享研究

[目的/意义]旨在解决现有的车联网数据共享方案中计算开销大、共享效率低、安全性不足等问题。[方法/过程]设计了一个车联网高效数据安全共享方案,采用基于线性秘密共享(LSSS)的密文策略属性加密(CP-ABE)算法和基于联盟区块链群组技术,实现了车联网高效数据共享,减少数据冗余,并通过共识机制的优化,进一步提高时间效率,同时确保车辆实体的数据安全性和隐私性。[结果/结论]该方案能够适应车联网快速移动、动态变化的复杂特性,可实现灵活访问控制和高自由度的数据共享,满足车联网场景需求。

基于公交优先的直线式公交站台共享超车道时空资源优化分析

受城市道路红线条件限制,许多公交车站只能设置直线式公交站台;这种形式的站台很容易产生拥堵排队和机动车冲突的交通现象。基于此,提出了一种共享超车道感应信号控制的优化方案,使用VISSIM软件对共享超车道前后车辆的延误水平进行了仿真分析。研究结果表明:通过设置共享超车道能有效地缓解公交车辆在公交站点拥堵排队和机动车冲突的交通现象;在交通量较大和公交发车频率较高情况下,通过设置带有共享超车道的直线式公交站台能有效地提升公交服务水平,保障近道路交叉口上游路段的公交优先通行和社会车辆有序通行,提升了交通的流畅性与安全性。

车联网中支持直接撤销的外包属性签名方案

数字签名在应对车联网中数据窜改威胁时扮演着重要作用,然而现有的签名方案在灵活性、效率、隐私保护、用户密钥管理等方面存在诸多问题,难以在车联网中释放其潜力。针对这些问题,提出了一个面向车联网的直接可撤销外包属性签名方案。该方案使用了基于线性秘密分享的签名策略机制,赋予车联网用户在签名生成和验证方面的灵活性和隐私保护。此外,设计了一种高效的用户密钥直接撤销机制,以提供对用户的实时撤权。所提方案还构造了一种外包验证方法,从而显著降低了验证者的计算和存储开销。安全性分析结果表明,所提方案在选择消息攻击下具有不可伪造性,并且能够抵抗合谋攻击。实验结果表明了该方案相较于其他方案的优势及其在车联网中的实用性。

医疗云平台中个人健康档案转诊时的安全共享方案

为解决医疗云平台共享个人健康档案(personal health record,PHR)存在的隐私泄露和加解密效率不理想的问题,以医疗云平台中帕金森病患者的转诊场景为例,提出了一种基于线性秘密共享的改进密文属性代理重加密方案(improved linear secret sharing based ciphertext attribute proxy re-encryption scheme,LCPS)。该方案利用线性秘密共享技术来隐藏访问策略中的隐私属性,降低因访问策略暴露引发的隐私泄露风险;该方案还对代理重加密算法进行改进,通过减少复杂的双线性运算,提高了加解密效率。结果表明,LCPS在加解密方面的表现要优于其他方案。在判定性q-BDHE(q-decisional bilinear Diffie-Hellman exponent)困难假设下具有选择明文攻击时的不可区分性(indistinguishability under chosen-plaintext attack,IND-CPA)。该方案具有可移植性,同样适用于医疗云中其他病症转诊时的个人健康档案安全共享。

火力发电厂分时线性智能吹灰模型的应用

基于长短期记忆(LSTM)算法对结渣过程进行建模,开发炉膛水冷壁结渣监测模型,并且开发了基于分散控制系统(DCS)的锅炉智能吹灰系统。该系统实现了锅炉运行时的智能吹灰、自动疏水和自动投停过程,保证了锅炉受热面的安全,在某热电厂启用智能吹灰方法后,吹灰总频次显著降低,有效地降低了吹灰器投运频次和吹灰蒸汽消耗量,降低了排烟温度。

A multilevel preconditioner and its shared memory implementation for a new generation reservoir simulator

As a result of the interplay between advances in computer hardware, software, and algorithm, we are now in a new era of large-scale reservoir simulation, which focuses on accurate flow description, fine reservoir characterization, efficient nonlinear/linear solvers, and parallel implementation. In this paper, we discuss a multilevel preconditioner in a new-generation simulator and its implementation on multicore computers. This preconditioner relies on the method of subspace corrections to solve large-scale linear systems arising from fully implicit methods in reservoir simulations. We investigate the parallel efficiency and robustness of the proposed method by applying it to million-cell benchmark problems.

Two-Hop Gaussian Relay Channel with Linear Relaying： Achievable Rate and Optimization Design

The relay node with linear relaying transmits the linear combination of its past received signals.The optimization of two-hop relay channel with linear relaying is discussed in this paper.The capacity for the two-hop Gaussian relay channel with linear relaying is derived,which can be formulated as an optimization problem over the relaying matrix and the covariance matrix of the signals transmitted at the source.It is proved that the solution to this optimization problem is equivalent to a "single-letter" optimization problem.We also show that the solution to this "single-letter" optimization problem has the same form as the expression of the rate achieved by Time-Sharing Amplify and Forward(TSAF).In order to solve this equivalent problem,we proposed an iterative algorithm.Simulation results show that if channel gain of one hop is relatively smaller,the achievable rate with TSAF is closer to the max-flow min-cut capacity bound,but at a lower complexity.

A Novel Progressive Secret Image Sharing Method with Better Robustness

Secret image sharing (SIS) can be utilized to protect a secret image during transmit in the public channels. However, classic SIS schemes, e.g., visual secret sharing (VSS) and polynomial-based scheme, are not suitable for progressive encryption of greyscale images in noisy environment, since they will result in different problems, such as lossy recovery, pixel expansion, complex computation, "All-or-Nothing"and robustness. In this paper, a novel progressive secret sharing (PSS)method based on the linear congruence equation, namely LCPSS, is proposed to solve these problems. LCPSS is simple designed and easy to realize, but naturally has many great properties, e.g., (k, n) threshold,progressive recovery, lossless recovery, lack of robustness and simple computation.

Security Analysis of Secret Image Sharing

Differently from pure data encryption,secret image sharing(SIS)mainly focuses on image protection through generating a secret image into n shadow images(shares)distributed to n associated participants.The secret image can be reconstructed by collecting sufficient shadow images.In recent years,many SIS schemes are proposed,among which Shamir’s polynomial-based SIS scheme and visual secret sharing(VSS)also called visual cryptography scheme(VCS)are the primary branches.However,as the basic research issues,the security analysis and security level classification of SIS are rarely discussed.In this paper,based on the study of image feature and typical SIS schemes,four security levels are classified as well as the security of typical SIS schemes are analyzed.Furthermore,experiments are conducted to evaluate the efficiency of our analysis by employing illustrations and evaluation metrics.

The “Endogenous” Planning and Design Strategy of the Park Under the Non-linear Thinking

Shanghai is in the period of urban transformation, so it is urgent to focus on building urban cultural brand, improving the quality of urban environment, and actively promoting urban fine design. The study combined the planning and design scheme of Chuansha Software Park, and used the non-linear thinking method to pay attention to the spatial practice of public significance from the aspects of planning spatial pattern, sharing community construction and site spirit, so as to explore the "endogenous" industrial park planning and design strategy, in order to provide reference for the planning and design of the park and decision-making consultation.

A General(k,n)Threshold Secret Image Sharing Construction Based on Matrix Theory

Shamir proposed a classic polynomial-based secret sharing(SS)scheme,which is also widely applied in secret image sharing(SIS).However,the following researchers paid more attention to the development of properties,such as lossless recovery,rather than the principle of Shamir’s polynomial-based SS scheme.In this paper,we introduce matrix theory to analyze Shamir’s polynomial-based scheme as well as propose a general(k,n)threshold SIS construction based on matrix theory.Besides,it is proved that Shamir’s polynomial-based SS scheme is a special case of our construction method.Both experimental results and analyses are given to demonstrate the effectiveness of the proposed construction method.

基于边缘计算的多授权属性加密方案

传统云存储下属性加密通常在云端与用户直接交流,并且由单一授权机构处理密钥与数据信息,为此提出一种应用在边缘环境下的多授权属性加密方案。方案中的访问矩阵由线性秘密共享构建,将边缘平台作为中间节点,用椭圆曲线密码体制下的简单标量乘法替代属性加密中的双线性计算,通过多授权中心分摊属性管理,直接减少单个授权机构的密钥托管与局部失控问题。理论功能分析与实验结果表明,该方案在可行性与安全性上均优于传统同类算法,有效降低了用户在访问控制中的计算开销。

一种具有策略隐藏的策略控制签名方案

策略控制签名可以通过访问策略对签名验证权限进行管理,然而由于公开的访问策略极可能包含隐私信息,导致用户隐私泄露.为此,提出了一种具有策略隐藏的策略控制签名方案,该方案使用线性秘密共享方案作为访问结构,通过以基于3素数合数阶双线性群为基础,将可能暴露隐私的属性值进行隐藏,并公开属性名策略.基于CDH假设和安全模型,证明了该方案的不可伪造性.最后对方案进行实验分析对比,结果表明:在签名验证阶段提出的方案效率高.