Quantum Oblivious Transfer with Reusable Bell State

In cryptography,oblivious transfer(OT)is an important multiparty cryptographic primitive and protocol,that is suitable for many upperlayer applications,such as secure computation,remote coin-flipping,electrical contract signing and exchanging secrets simultaneously.However,some nogo theorems have been established,indicating that one-out-of-two quantum oblivious transfer(QOT)protocols with unconditional security are impossible.Fortunately,some one-out-of-two QOT protocols using the concept of Crepeau’s reduction have been demonstrated not to conform to Lo’s no-go theorem,but these protocols require more quantum resources to generate classical keys using all-or-nothing QOT to construct one-out-of-two QOT.This paper proposes a novel and efficient one-out-of-two QOT which uses quantum resources directly instead of wasting unnecessary resources to generate classical keys.The proposed protocol is not covered by Lo’s no-go theorem,and it is able to check the sender’s loyalty and avoid the attack from the receiver.Moreover,the entangled state of the proposed protocol is reusable,so it can provide more services for the participants when necessary.Compared with otherQOT protocols,the proposed protocol is more secure,efficient,and flexible,which not only can prevent external and internal attacks,but also reduce the required resources and resource distribution time.

从面向方面程序设计的定义到面向方面程序设计语言

目前无论在学术界还是工业界,很多人士简单地将面向方面程序设计理解为模块化横切关注点,狭隘地认为面向方面程序设计构建在面向对象程序设计之上,是面向对象程序设计的扩展、有效的补充等。回顾了面向方面程序设计的定义,分析了面向方面程序设计区别于其它程序设计方法的本质特征,并形式化了定义中的量化语句与方面,给出了量化语句与方面的语义。重申了面向方面程序设计的本质特性是Quantification与Obliviousness,模块化横切关注点只是其带来的一个好处。同时指出了面向方面程序设计是一种新型的程序设计范式,独立于面向对象等其它程序设计方法。并且,基于此定义,给出了面向方面程序设计语言需满足的最小条件集,并比较了主流的面向方面程序设计语言,探讨了这些语言在面向方面程序设计理念上的差异。

航空集群机载网络Failure-Oblivious路由策略

航空集群机载网络作为集群成员间信息交互的纽带,其路由策略性能优劣直接影响信息传输实时性与可靠性,从而制约网络化集群作战效能发挥。考虑到航空集群机载网络具有诸多不确定性,为应对路由失效以及尽可能避免路由更新,从路由选择算法的角度,在软件定义网络架构下提出Failure-Oblivious路由策略。与传统路由策略不同的是,该策略利用随机算法生成多条路由,能够在不进行路由失效预测的情况下应对路由随机失效问题。理论推导与仿真验证表明,该策略能够在保证通信时效性代价可控的基础上,降低航空集群机载网络路由失效风险。

基于3D-Mesh网络的一种Oblivious路由算法

3D-Mesh就是三维片上网络中一种常见拓扑结构.本文针对3D-Mesh网络提出了一种新的高吞吐率的随机Oblivious路由算法(Double Plane Turn,DPT).DPT算法通过降维,将3D-mesh网络转化为两个互相垂直2Dmesh,然后在2D-mesh网络下使用01Turn路由算法.由于01Turn路由算法具有良好的平均情况下的网络吞吐率和不错的延时,通过仿真实验证明,和以往的路由算法在平均情况下的网络吞吐率相比,本算法都实现了较好的结果.

基于匈牙利算法评估路由算法中网络负载的方法

最坏情况的吞吐率是衡量路由算法性能的重要因素之一。负载最重的地方是最坏情况吞吐率的体现,因此最坏情况的吞吐率在路由算法中很关键。在此基础上本文提出了通过利用匈牙利算法来评估网络负载的方法并且通过实验仿真进行比较。将匈牙利算法和穷举法运用到Oblivious路由中的O1TURN、VAL等算法中进行比较。实验结果表明运用该方法与利用传统的穷举法相比,可以大大减少计算量、降低时间复杂度,实验结果证明了方法的可行性和有效性。

Privacy-Preserving Decision Protocols Based on Quantum Oblivious Key Distribution

Oblivious key transfer(OKT)is a fundamental problem in the field of secure multi-party computation.It makes the provider send a secret key sequence to the user obliviously,i.e.,the user may only get almost one bit key in the sequence which is unknown to the provider.Recently,a number of works have sought to establish the corresponding quantum oblivious key transfer model and rename it as quantum oblivious key distribution(QOKD)from the well-known expression of quantum key distribution(QKD).In this paper,a new QOKD model is firstly proposed for the provider and user with limited quantum capabilities,where both of them just perform computational basis measurement for single photons.Then we show that the privacy for both of them can be protected,since the probability of getting other’s raw-key bits without being detected is exponentially small.Furthermore,we give the solutions to some special decision problems such as set-member decision and point-inclusion by announcing the improved shifting strategies followed QOKD.Finally,the further discussions and applications of our ideas have been presented.

Dynamic Proofs of Retrievability Based on Partitioning-Based Square Root Oblivious RAM

With the development of cloud storage,the problem of efficiently checking and proving data integrity needs more consideration.Therefore,much of growing interest has been pursed in the context of the integrity verification of cloud storage.Provable data possession(PDP)and Proofs of retrievablity(POR)are two kinds of important scheme which can guarantee the data integrity in the cloud storage environments.The main difference between them is that POR schemes store a redundant encoding of the client data on the server so as to she has the ability of retrievablity while PDP does not have.Unfortunately,most of POR schemes support only static data.Stefanov et al.proposed a dynamic POR,but their scheme need a large of amount of client storage and has a large audit cost.Cash et al.use Oblivious RAM(ORAM)to construct a fully dynamic POR scheme,but the cost of their scheme is also very heavy.Based on the idea which proposed by Cash,we propose dynamic proofs of retrievability via Partitioning-Based Square Root Oblivious RAM(DPoR-PSR-ORAM).Firstly,the notions used in our scheme are defined.The Partitioning-Based Square Root Oblivious RAM(PSR-ORAM)protocol is also proposed.The DPOR-PSR-ORAM Model which includes the formal definitions,security definitions and model construction methods are described in the paper.Finally,we give the security analysis and efficiency analysis.The analysis results show that our scheme not only has the property of correctness,authenticity,next-read pattern hiding and retrievabiltiy,but also has the high efficiency.

OBLIVIOUS TRANSFER WITH ACCESS CONTROL AND IDENTITY-BASED ENCRYPTION WITH ANONYMOUS KEY ISSUING

In ACM'CCS 2009,Camenisch,et al.proposed the Oblivious Transfer with Access Control(AC-OT) in which each item is associated with an attribute set and can only be available,on request,to the users who have all the attributes in the associated set.Namely,AC-OT achieves access control policy for conjunction of attributes.Essentially,the functionality of AC-OT is equivalent to the sim-plified version that we call AC-OT-SV:for each item,one attribute is associated with it,and it is requested that only the users who possess the associated attribute can obtain the item by queries.On one hand,AC-OT-SV is a special case of AC-OT when there is just one associated attribute with each item.On the other hand,any AC-OT can be realized by an AC-OT-SV.In this paper,we first present a concrete AC-OT-SV protocol which is proved to be secure in the model defined by Camenisch,et al..Then from the protocol,interestingly,a concrete Identity-Based Encryption(IBE) with Anonymous Key Issuing(AKI) is given which is just a direct application to AC-OT-SV.By comparison,we show that the AKI protocol we present is more efficient in communications than that proposed by Chow.

一种基于Torus网络的高效随机Oblivious路由算法

一个好的路由算法应同时满足:最小的路由跳数以减小传输延时,保持通讯的局域性;最大的平均情况和最坏情况吞吐率;简单的路由器结构。随机Oblivious路由算法在低功耗并行计算机互联网络以及片上网络中得到广泛应用。针对Torus网络下已提出的Oblivious路由算法所需虚通道数目多的缺点,提出了随机Oblivious路由算法WRD,该算法仅使用两条虚拟通道即可实现算法的无死锁性。通过仿真对所提算法的性能进行了验证,结果表明,该算法与使用两条虚拟通道的O1TURN路由算法相比,WRD路由算法在所有通讯模式下的网络吞吐率均有所提升。与使用四条虚拟通道的RLB算法相比,新提出的WRD路由算法性能接近于RLB算法,甚至在多个通讯模式下的网络吞吐率要好于RLB算法,而且WRD路由算法仅使用两条虚拟通道,降低了网络系统成本和功耗。

Quantum private query: A new kind of practical quantum cryptographic protocol

This research aims to review the developments in the field of quantum private query(QPQ), a type of practical quantum cryptographic protocol. The primary protocol, as proposed by Jacobi et al., and the improvements in the protocol are introduced.Then, the advancements made in sability, theoretical security, and practical security are summarized. Additionally, we describe two new results concerning QPQ security. We emphasize that a procedure to detect outside adversaries is necessary for QPQ, as well as for other quantum secure computation protocols, and then briefly propose such a strategy. Furthermore, we show that the shift-and-addition or low-shift-and-addition technique can be used to obtain a secure real-world implementation of QPQ, where a weak coherent source is used instead of an ideal single-photon source.

Universally composable oblivious transfer from ideal lattice

As a fundamental cryptographic primitive, oblivious transfer (OT) is developed for the sake of efficient usability and combinational feasibility. However, most OT protocols are built upon some quantum non-immune cryptosystems by assuming the hardness of discrete logarithm or factoring problem, whose security will break down directly in the quantum setting. Therefore, as a subarea of postquantum cryptography, lattice-based cryptography is viewed as a promising alternative and cornerstone to support for building post-quantum protocols since it enjoys some attractive properties, such as provable security against quantum adversaries and lower asymptotic complexity. In this paper, we first build an efficient 1-out-of-2 OT protocol upon the hardness of ring learning with errors (RLWE) problem, which is at least as hard as some worst-case ideal lattice problems. We show that this 1-out-of-2 OT protocol can be universally composable and secure against static corruptions in the random oracle model. Then we extend it to a general case, i.e., 1-out-of-N OT with achieving the same level of security. Furthermore, on the basis of the above OT structure, we obtain two improved OT protocols using two improved lattice-based key exchange protocols (respectively relying on the RLWE problem and learning with errors (LWE) problem, and both achieving better efficiency by removing the Gaussian sampling for saving cost) as building blocks. To show that our proposed OT protocol indeed achieves comparable security and efficiency, we make a comparison with another two lattice-based OT protocols in the end of the paper. With concerning on the potential threat from quantum computing and expecting on the practical use of OT with high efficiency, an efficient post-quantum OT protocol is pressing needed. As shown in this paper, our proposed OT protocols may be considered as post-quantum OT candidates since they can both preserve provable security relying on lattice problems and enjoy practical efficiency.

Unconditionally Secure Oblivious Polynomial Evaluation:A Survey and New Results

Oblivious polynomial evaluation(OPE)is a two-party protocol that allows a receiver,R to learn an evaluation f(α),of a sender,S's polynomial(f(x)),whilst keeping both a and f(x)private.This protocol has attracted a lot of attention recently,as it has wide ranging applications in the field of cryptography.In this article we review some of these applications and,additionally,take an in-depth look at the special case of information theoretic OPE.Specifically,we provide a current and critical review of the existing information theoretic OPE protocols in the literature.We divide these protocols into two distinct cases(three-party and distributed OPE)allowing for the easy distinction and classification of future information theoretic OPE protocols.In addition to this work,we also develop several modifications and extensions to existing schemes,resulting in increased security,flexibility and efficiency.Lastly,we also identify a security flaw in a previously published OPE scheme.

Concretely ecient secure multi-party computation protocols:survey and mor

Secure multi-party computation(MPC)allows a set of parties to jointly compute a function on their private inputs,and reveals nothing but the output of the function.In the last decade,MPC has rapidly moved from a purely theoretical study to an object of practical interest,with a growing interest in practical applications such as privacy-preserving machine learning(PPML).In this paper,we comprehensively survey existing work on concretely ecient MPC protocols with both semi-honest and malicious security,in both dishonest-majority and honest-majority settings.We focus on considering the notion of security with abort,meaning that corrupted parties could prevent honest parties from receiving output after they receive output.We present high-level ideas of the basic and key approaches for designing di erent styles of MPC protocols and the crucial building blocks of MPC.For MPC applications,we compare the known PPML protocols built on MPC,and describe the eciency of private inference and training for the state-of-the-art PPML protocols.Further-more,we summarize several challenges and open problems to break though the eciency of MPC protocols as well as some interesting future work that is worth being addressed.This survey aims to provide the recent development and key approaches of MPC to researchers,who are interested in knowing,improving,and applying concretely ecient MPC protocols.