Method of Homomorphic Encryption

The existing homomorphie eneryption scheme is based on ring of the integer, and the possible operators are restricted to addition and multiplication only. In this paper, a new operation is defined Similar Modul. Base on the Similar Modul, the number sets of the homomorphic encryption scheme is extended to real number, and the possible operators are extended to addition, subtraction, multiplication and division. Our new approach provides a practical ways of implementation because of the extension of the operators and the number sets.     

A New Forward-Secure Authenticated Encryption Scheme with Message Linkages

Yoon and Yoo recently proposed a robust authenticated encryption scheme and claimed their scheme has the properties of forward secrecy and confidentiality. The current paper, however, points out that Yoon-Yoo＇s scheme also can not provide forward secrecy and confidentiality such that any adversary can easily recover the transferred message. Based on intractability of reversing the one-way hash function and discrete logarithm problem, an improved authenticated encryption scheme with messages linkage is proposed. The above security faults get solved perfectly. The new scheme is proven to satisfy all the basic security requirements of the authenticated encryption scheme. And by the concrete comparison, it has the similar efficiency of the original scheme.     

Public Key Cryptography Based on Ergodic Matrices over Finite Field

A new public key encryption scheme is proposed in this paper, which is based on a hard problem over ergodic matrices. The security of this scheme is equal to the MQ-problem： multivariate quadratic equations over finite fields. This problem has been shown to be NP-complete and can＇t be solved with polynomial time algorithm.     

Merkle Tree Digital Signature and Trusted Computing Platform

0 IntroductionDigital signatureis a key technique to provide datainteg-rity andsource authenticationcapabilities to enhance da-ta trustworthiness in trusted computing platform. Most cur-rent digital signature schemes are based on complex mathe-matical problems , such as integer factoring, discrete log-arithm,and discrete logarithm on elliptic curves . The hard-ness of these underlying mathematical problems is really un-certain at present . Merkle treeis a method used for authenti-cation and di…     

Targeted Fully Homomorphic Encryption Based on a Double Decryption Algorithm for Polynomials

Several public-key encryption schemes used to solve the problem of ciphertext data processing on the fly are discussed. A new targeted fully homomorphic encryption scheme based on the discrete logarithm problem is presented. Public-key encryption cryptosystems are classified to examine homomorphic encryption. Without employing techniques proposed by Gentry such as somewhat homomorphic and bootstrapping techniques, or relinearization technique proposed by Brakerski et al., a new method called ＂Double Decryption Algorithm＂ is employed in our cryptography to satisfy a fully or targeted fully homomorphic property. Inspired by EIGamal and BGN cryptography, we obtain the desired fully homomorphic property by selecting a new group and adding an extra component to the ciphertext. Proof of semantic security is also demonstrated.     

RTP-Packets＇ Loss Recovery Scheme Based on Layered Buffer-Routers

This paper introduces an RTP-packets‘ loss recovery scheme in MPEG-4 playback type multicast application model, which is based on retransmission scheme. Through the auxiliary and coordinated buffer playing scheme of layered “buffer-routers”, the RTP-packets‘ loss recovery in limited time is made possible. We consider in the scheme to handle retransmission request with buffer waiting when network congestion occurs. Thus, neither the degree of congestion will be worsened nor the retransmission request will be lost when sending the request to higherlevel buffer router. The RTP-packets‘ loss recovery scheme suggested by us is not only applied to MPEG-4 muhieast application in LAN, but also can be extended to more spacious WAN (wide area network) when user groups comparatively centralize in certain number of local areas.     

在线/离线非单调CP-ABE方案构造

提出了支持非单调访问结构的在线/离线的CP-ABE方案。在离线加密阶段,完成了密文的主要构成部分的计算;在线加密阶段,将正属性集合上的非单调访问控制结构转变成由正、负属性集合上的基于线性秘密共享方案的单调访问控制结构,利用少量的加法和乘法操作生成密文的其余构成部分。在n-(B)假设成立条件下,证明了该方案具有选择性安全性。与原来的非单调CP-ABE方案相比,该方案系统参数和私钥规模保持不变,加密的总体计算复杂度仅有少量增加,但在线加密阶段的计算复杂度较小,可与解密外包服务相结合,使得该方案的离线加密和解密阶段都可在资源受限的小型设备上完成。     

基于Paillier和PSI的多关键字可搜索加密方案

围绕多关键字的高效密文搜索和数据安全性保障问题,展开分析与研究,基于同态加密和私有集合交集技术,提出一种面向多关键字的高效的保护搜索模式的可搜索加密方案.该方案使用随机数填充和Paillier同态加密方法构造安全索引和陷门,保护了索引隐私和陷门隐私,进而保护了搜索模式;该方案通过私有集合交集技术进行连接多关键字搜索,搜索中只使用到了乘法和指数运算,与其他方案相比大大提高了效率;安全性和性能分析表明,该方案具有可搜索加密的语义安全性,可以高效地实现对密文的多关键字搜索,且具有良好的计算代价.     

Efficient broadcast encryption scheme based on number theory research unit

In this paper, a new broadcast encryption scheme is proposed by using the efficient and computationally inexpensive public key cryptosystem NTRU (number theory research unit). In our scheme, we use the idea of RSA and develop this idea from two-party to multi-party, and combine this multi-party public key idea with the multiplication in ring R of NTRU. What we get from this design is extremely efficient encryption and decryption, fast and easy key creation, low memory requirements and revocation property, etc. Moreover, this novel work contains other desirable features, such as traitor tracing. With its complexity only O(log₂ n), the tracing algorithm of this system is more efficient than that of the previous ones.     

Singularity detecting with the second generation wavelet

Adopting the lifting scheme, introduced by Sweldens, a new wavelet is constructed. It overcomes the shortcoming of the classical wavelets that has no flexibility in the number of vanishing moment. Two examples are given to prove the second-generation wavelets‘s potentialities in the singularity detection of signal: a wavelet with vanishing moment and symmetry can be constructed according to the problem.     

A binary images watermarking algorithm based on adaptable matrix

A watermarking algorithm of binary images using adaptable matrix is presented. An adaptable matrix is designed to evaluate the smoothness and the connectivity of binary images. The watermark is embedded according to the adaptable matrix in this algorithm. In the proposed watermarking algorithm, each image block implements a XOR operation with the binary adaptable matrix, which has the same size with the image block, and in order to embed the watermark data, a multiplication operation are also implemented with the weight matrix. The experimental results show that proposed scheme has a good performance.     

A New ID-Based Proxy Multi-Signature Scheme from Bilinear Pairings

ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we prove that our new scheme is secure against existential delegation forgery with the assumption that Hess＇s scheme-1 is existential unforgeable, and that our new scheme is secure against existential proxy multi-signature forgery under the hardness assumption of the computational Diffie-Hellman problem.     

A Secure Anonymous Internet Electronic Voting Scheme Based on the Polynomial

In this paper, we use the polynomial function and Chaum＇s RSA （Rivest, Shamir, Adleman） blind signature scheme to construct a secure anonymous internet electronic voting scheme. In our scheme, each vote does not need to be revealed in the tallying phase. The ballot number of each candidate gets is counted by computing the degrees of two polynomials＇ greatest common divisor. Our scheme does not require a special voting channel and communication can occur entirely over the current internet.     

Efficient Identity Based Signcryption Scheme with Public Verifiability and Forward Security

In this paper, we point out that Libert and Quisquater‘s signeryption scheme cannot provide public verifiability. Then we present a new identity based signcryption scheme using quadratic residue and pairings over elliptic curves. It combines the functionalities of both public verifiability and forward security at the same time. Under the Bilinear Diffie-Hellman and quadratic residue assumption, we describe the new scheme that is more secure and can be some what more efficient than Libert and Quisquater‘s one.     

基于MGSW15方案的分组密码电路的同态运算

全同态加密(FHE)允许在不知道秘密信息的前提下对密文进行任意运算,已成为大数据和云安全背景下的热门研究方向,近年来取得了重大进展.但在实际应用中全同态加密仍面临诸多问题,其中严重的密文扩张给密文传输带来了巨大压力,通过将全同态加密方案与对称密码相融合可以有效解决这一问题.GSW类型的全同态加密方案效率较高,且进行同态计算不需要再线性化技术,本文选取了支持并行操作的MGSW15方案,其密文可以转化为任意基于LWE的FHE方案的密文.给出了在云计算背景下基于MGSW15方案实现密文压缩的基本框架,并利用该方案分别同态计算实现了分组密码AES-128、PRINCE、SIMON-64/128电路,根据每种分组密码的结构特点对其明文分组采用多种切割方式以提高同态运算效率,最后对效率和安全性进行了分析.结合AES算法的安全性、通用性以及轻量级分组密码算法PRINCE和SIMON的高效性,本文的工作在实际应用中效率更高、应用范围更广,密文传输量与明文规模的比值趋近于1,且传输1比特明文只需进行O(1)次同态乘法.     

An efficient identity-based anonymous signcryption scheme

Signcryption is a cryptographic primitive that performs encryption and signature in a single logical step more efficiently than sign-then-encrypt approach. Till now, various kinds of signcryption schemes have been proposed. Among them, the requirement of signcrypter＇s privacy protection is needful in some practical applications. In this paper, a new identity-based anonymous signcryption scheme from hilinear pairings, which is the organic combination of identity-based ring signature and encryption scheme, is proposed. The proposed scheme is indistinguishable against the chosen ciphertext attack under the Decisional Bilinear Diffie-Hellman assumption in the random oracle model. Its unforgeability relies on the computational Diffieellman problem. Compared with the previous schemes, the new scheme is more efficient in computation.     

A New （ t, n） Threshold Signature Scheme Withstanding the Conspiracy Attack

A conspiracy attack is proposed to show that Wang-Li‘s scheme is insecure, because any t or more group members can impersonate other t members to sign any message without holding the responsibility. To avoid the conspiracy attack, this paper presents a new (t, n) threshold signature scheme with traceable signers.     

A new certificateless public key encryption scheme

Certificateless public key cryptography （CL-PKC） enjoys the advantage of identity based cryptography without suffering from its inherent key escrow problem. In this paper, a new efficient certificateless public key encryption scheme is proposed and its security can reach chosen-ciphertext （CCA2） secure in the random oracle model assuming the CDH and p-BDHI problem are difficult. A comparison shows that the efficiency of the proposed scheme is better than all known paring-based certificateless public key encryption schemes in the random oracle model.     

Do search and selection operators play important roles in Multi-objective Evolutionary Algorithms: A case study

Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by solving a case of discrete Multi-objective Optimization Problem (MOP): Multi-objective TSP with a new MOEA. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using finite Markov chain and proved that it could converge to Pareto Front with probability 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators. Foundation item: Supported by the National Natural Science Foundation of China (60133010,70071042,60073043) Biography: Yan Zhen-yu( 1977-), male, Master student, research interests: computational intelligence, evolutionary computation.     

A Signature Scheme with Non-Repudiation

Based on the Schnorr signature scheme, a new signature scheme with non-repudiation is proposed. In this scheme, only the signer and the designated receiver can verify the signature signed by the signer, and if necessary, both the signer and the designated receiver can prove and show the validity of the signature signed by the signer. The proof of the validity of the signature is noninteractive and transferable. To verify and prove the validity of the signature, the signer and the nominated receiver needn＇t store extra information besides the signature. At the same time, neither the signer nor the designated receiver can deny a valid signature signed. Then, there is no repudiation in this new signature scheme. According to the security analysis of this scheme, it is found the proposed scheme is secure against existential forgery on adaptive chosen message attack.