可信模块隐私保护的自证明签密方案

提出可信模块间安全通信的一种高效的基于自证明公钥的签密方案IDSSS,它可以抵抗不诚实证书签发方(CA)的消息伪造攻击和共谋攻击,且中间人在获得密文后,如果没有接收方密钥则无法知道验证密文的签密者和接收者,实现了密文的匿名性.给出了系统模型并证明了其安全性,包括语义安全性、不可伪造性、密文匿名性和不诚实CA的可追踪性.方案可应用于要求身份隐藏和身份隐私保护的安全传输环境.与其他相似方案比较,IDSSS方案有更强的安全性和更高的计算效率.

一种基于零知识证明的军事物联网位置隐私保护方案设计与仿真

在军事物联网作战环境中,位置隐私问题成为关键挑战。提出了一种基于零知识证明的位置隐私保护方案,以确保在不可靠的通信信道中,作战单位的位置信息既得以验证,又无需暴露其具体坐标,达到保护敏感位置信息的目的。基于密码学思想,利用零知识证明,通过代数电路、R1CS(rank-1 constraint system)、QAP(quadratic arithmetic programs)等步骤将位置坐标信息证明问题转换为多项式曲线上的点验证问题,在一轮挑战-响应过程中完成位置验证。仿真结果验证了该方案的有效性,提升了位置信息的安全性,有着广阔的实际应用价值。研究成果为未来军事作战中的安全定位提供了一种新的解决方案,进一步强化了军事物联网作战的安全保障。

基于区块链的公平可验证数据持有方案

针对传统可证明数据持有(Provable Data Possession,PDP)方案中要求客户端是诚实的这一问题,基于区块链技术提出了公平的可证明数据持有方案.在传统PDP方案中,总是假定服务器是半诚实而客户端是可信的,这对服务器而言是不公平的.在基于区块链的公平PDP方案中,用于检验的元数据不再由客户端生成,而是由区块链节点生成并对其达成共识.因此,借助区块链的分布式信任性质可以实现PDP方案的互信机制,保证客户端和云服务器之间的公平性.同时,利用哈希函数、Pedersen承诺实现高效的公平PDP方案.分析所提方案的安全性、计算开销、通信开销以及冗余率.分析结果表明,在保障安全性的基础上,所提方案比同类方案具有更优的计算开销、通信开销及冗余率.

浅析化学检测实验室的方法验证与确认

依照相关控制标准,为了证实所用手段是满足所确定目标的需要的,化学科目测定实验台须对所应用的测试流程展开验证及认可过程,基于此,应出具现实证据材料来证明所实施手段的预定功用是否已获得实现。文章以手段明确及验实的概念、应用的区间规定为依托,对照了二者的区别;商议了实施方案证实的恰当时机以及实施手段认定的时间窗口,另外包括实施方法认定及证明的相关流程。同时,笔者也探讨了手段认定及证明环节中牵扯到的功能数据,涵盖准确性、正确性、精密性、线型性、检出域、定量域、选取性/异质性及测量误差域,给手段验证及证实过程的开展提供了依据。

A Resistant Quantum Key Exchange Protocol and Its Corresponding Encryption Scheme

The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant quantum cryptography very urgent. This motivate us to design a new key exchange protocol and eneryption scheme in this paper. Firstly, some acknowledged mathematical problems was introduced, such as ergodic matrix problem and tensor decomposition problem, the two problems have been proved to NPC hard. From the computational complexity prospective, NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them. From the algebraic structures prospective, non-commutative cryptography has been considered to resist quantum. The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures, so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures. Secondly, a new problem was constructed based on the introduced problems in this paper, then a key exchange protocol and a public key encryption scheme were proposed based on it. Finally the security analysis, efficiency, recommended parameters, performance evaluation and etc. were also been given. The two schemes has the following characteristics, provable security,security bits can be scalable, to achieve high efficiency, quantum resistance, and etc.

Provably Secure General Aggregate Signcryption Scheme in the Random Oracle Model

To reduce the size of certificate chains and the ciphertext size in secure routing protocols, a General Aggregate Signcryption Scheme (GASC) is presented. In GASC, an identity-based signcryption algorithm and an aggregate signature algorithm are combined in a practical and secure manner to form the general aggregate signcryption scheme's schema and concept, and a new secure, efficiently general aggregate signcryption scheme, which allows the aggregation of n distinct signcryptions by n distinct users on n distinct messages, is proposed. First, the correction of the GASC scheme is analyzed. Then, we formally prove the security of GASC in the random oracle models IND-CCA2 and EUF-CMA under the DBDHP assumption and the DLP assumption, respectively. The results show that the GASC scheme is not only secure against any probabilistic polynomial-time IND-GASC-CCA2 and EUF-GASC-CMA adversary in the random oracle models but also efficient in pairing ê computations. In addition, the GASC scheme gives an effective remedy to the key escrow problem, which is an inherent issue in IBC by splitting the private key into two parts, and reduces the communication complexity by eliminating the interaction among the senders (signers) before the signcryption generation.

Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme

In this paper, we first review the existing proofs of the Boneh-Franklin identity-based encryption scheme (BF-IBE for short), and show how to admit a new proof by slightly modifying the specifications of the hash functions of the original BF-IBE. Compared with prior proofs, our new proof provides a tighter security reduction and minimizes the use of random oracles, thus indicates BF-IBE has better provable security with our new choices of hash functions. The techniques developed in our proof can also be applied to improving security analysis of some other IBE schemes. As an independent technical contribution, we also give a rigorous proof of the Fujisaki-Okamoto (FO) transformation in the case of CPA-to-CCA, which demonstrates the efficiency of the FO-transformation (CPA-to-CCA), in terms of the tightness of security reduction, has long been underestimated. This result can remarkably benefit the security proofs of encryption schemes using the FO-transformation for CPA-to-CCA enhancement.

SEVERAL CRYPTOGRAPHIC APPLICATIONS OF ∑-PROTOCOL

∑-protocol has been proved to be a very powerful cryptographic tool and widely used in nnmerous important cryptographic applications. In this paper, the authors make use of ∑-protocol as a main tool to resolve the following difficult problems 1-3 and to construct three ettlcient cryptographic protocols 4 6：1） How to construct a protocol for proving a secret integer to be a Blum integer with form PQ, where P, Q are two different primes and both -- 3（mod 4）;2） How to construct a protocol for proving a secret polynomial with exact degree t - 1 iil a （t, n）- threshold secret sharing scheme：3） How to construct witness indistinguishable and witness hiding protocol not from zero-knowledge proof;4） A publicly verifiable secret sharing scheme with information-theoretic security;5） A delegateable signature scheme under the existence of one-way permutations;6） Non-interactive universal designated verifier signature schemes.