【作者】 王莉；

【导师】 王卿文；

【作者基本信息】 上海大学 ， 基础数学， 2013， 博士

【摘要】 矩阵理论作为一种基本的数学工具,在数学、物理学和其它科学技术领域(如统计分析、数值计算、优化理论、微分方程、概率统计、系统工程等)都有广泛应用.计算机及网络通信技术的发展也为矩阵理论的应用开辟了更广阔的前景.近年来,矩阵理论和密码学的交叉应用备受国内外学者的关注,获得了大量的研究成果.一方面,以矩阵理论为基础构造安全高效的密码体制解决信息安全问题.另一方面,利用各种密码技术设计安全高效的计算协议解决矩阵理论的多方共享问题.本文研究了矩阵理论在多方安全计算、秘密分享、基于身份签密这三个热点领域内的应用,得到了许多新的有意义的结果,这些结果进一步丰富了矩阵理论与信息安全领域的交叉应用.全文主要包括以下四个方面：1.一般线性方程组安全两方计算协议的设计与分析.广义逆矩阵是研究线性方程组解的一个不可或缺的重要工具,因此,本文在不经意传输的意义下,利用有限域上计算广义逆的概率算法,设计新的安全协议,解决了保护私有信息的一般线性方程组在有限域上的安全两方计算问题,丰富了隐私保护的线性方程组求解的研究内容.2.一般矩阵和安全多方计算协议的设计与分析.矩阵加法是矩阵最基本的运算,因此,矩阵应用的基础性和广泛性决定了矩阵和的安全多方计算是设计众多应用协议的基础协议,是解决科学计算、统计分析等实际问题重要的底层工具.本文基于递归思想,在不经意传输的意义下,设计了一般矩阵和的安全多方计算协议,并通过模拟器的构造证明了安全性.新的基础协议将服务于更多应用问题的有效解决.3.基于正交投影矩阵的秘密分享方案的密码攻击.正交投影矩阵的恒等不变性为门限秘密分享体制的设计提供了一种新的思路,本文对这种基于投影矩阵技术的秘密分享方案进行了密码分析,通过举例明确指出该方案不能抵抗欺诈攻击,无法阻止不诚实成员提供假份额参与秘密恢复,同时也无法识别恢复出秘密的真伪.更重要的是,本文利用投影矩阵理论和有限域上的矩阵理论严格证明了成员提供伪份额而不被发现的欺骗行为能以不可忽略的概率存在,并求出了该欺骗行为获得成功的概率.4.格上基于身份签密方案的设计与分析.格是一种重要的代数结构,以矩阵为基本工具.基于格问题构造的密码方案除了能抵抗量子攻击外,使得具有平均情况下安全性的公钥密码体制设计成为了可能,是后量子时代公钥密码的首选.本文基于q模格上的LWE困难问题和SIS困难问题,构造了一个基于身份的签密方案,并在随机预言模型下证明了方案的IND-CCA2和EUF-CMA安全性.另外,格上运算的线性性降低了方案的计算代价,提高了效率.更多还原

【Abstract】 As a fundamental tool, matrix theory has found many applications in math-ematical and physical science, as well as fertile felds for research including statis-tical analysis, numerical calculation, optimization theory, diferential equations,probability and statistics, and system engineering. The rapid development ofcomputer network and information technology also ofers new opportunities forits further application. Among them, studies on the application of matrix the-ory in cryptography have been extensively carried out by scholars both at homeand abroad. For instance, secure and efcient cryptographic systems based onmatrix theory have been designed to solve the problems of information security.On the other hand, secure and efcient computing protocols utilizing diferentcryptographic techniques provide alternative access to multi-party sharing prob-lems in matrix theory. In this thesis, we focused our attention on solving severalopen questions in the feld of secure multi-party computation, secret sharing andidentity-based signcryption, thus providing many meaningful new results over theknown ones. These results further facilitate the developments on matrix theoryand information security to some extent. Accordingly, the main contributions ofthis dissertation are as follows,1.Researches on the design and analysis of a secure two-party protocol forsolving systems Ax=b of m linear equations in n variables over a fnite feld.Generalized inverses play an important role in the solution of such linear sys-tems of equations. Given an implementation of oblivious transfer, we can solveprivacy-preserving cooperative linear system of equations of the form Ax=bby computing the generalized inverse. Based on this probabilistic algorithm, wepresent a secure two-party protocol to enrich the research contents on securelysolving linear system of equations.2.Researches on the design and analysis of a secure multi-party protocol of matrix addition. Matrix addition represents a basic operation in matrix theory,hence we propose a privacy-preserving cooperative matrix addition protocol inthe k-party model via oblivious transfer protocol and recursive method. In suchcase, the security is proven through constructing simulator. This basic protocolcan serve as a new tool to protect privacy in practical applications.3.Researches on the attack analysis of a secret sharing scheme using matrixprojection. Matrix projection and its invariance property provide a novel ideafor constructing threshold secret sharing system. In this thesis, the securitydefciency against cheating, which lies in a threshold secret sharing scheme usingprojection matrix, is presented. We exemplify that there exists only single cheaterpassing the check that makes other participants reconstruct an invalid secretwithout being detected. Most importantly, we also give a strict proof according tomatrix projection and matrix theory over fnite feld, which show that the cheaterhas non-negligible advantage in above deception. Moreover, the probability ofsuccessfully cheating is given.4.Researches on the design and analysis of ID-based signcryption from lattice.Lattice is an important algebraic structure with matrix as its basic tool. Owing toits strong resistance against quantum attack and security proofs based on average-case hardness, lattice-based cryptographic constructions hold a great promisefor post-quantum cryptography. In view of the average-case hard problems inq modular lattice such as LWE and SIS, we propose an ID-based signcryptionscheme, which security can be proved in the random oracle model of IND-CCA2and EUF-CMA security formally. Since linear operations in lattice reduce thecomputational cost, the presented scheme becomes more efcient.更多还原