Resist Quantum Attacks Research Articles

Identity‐based proxy signature over NTRU lattice

SummaryProxy signature scheme is an important cryptographic primitive, for an entity can delegate his signing right to another entity. Although identity‐based proxy signature schemes based on conventional number‐theoretic problems have been proposed for a long time, the researchers have paid less attention to lattice‐based proxy signature schemes that can resist quantum attack. In this paper, we first propose an identity‐based proxy signature scheme over Number Theory Research Unit (NTRU)‐lattice. We proved that the proposed paradigm is secure under the hardness of the γ‐shortest vector problem on the NTRU lattice in random oracle model; furthermore, the comparison with some existing schemes shows our scheme is more efficient in terms of proxy signature secret key size, proxy signature size, and computation complexity. As the elemental problem of the proposed scheme is difficult even for quantum computation model, our scheme can work well in quantum age.

Cybersecurity in an Era with Quantum Computers: Will We Be Ready?

Organizations must understand their specific risks and plan for their systems to be resilient to quantum attacks. Assessment is based on three quantities: the security shelf life of the information assets, the migration time to systems designed to resist quantum attacks, and the time remaining before quantum computers break the security.

Blind Proxy Re-Signature Scheme Based on Isomorphisms of Polynomials

Most of the existing blind proxy re-signature schemes are designed based on the traditional public key cryptosystems, whose security relies on the hardness of big integer factoring, discrete logarithm, elliptic curve discrete logarithm, and so on. However, these problems will be unsecure when facing the attack of quantum computers. Motivated by these concerns, we proposed a blind proxy re-signature scheme based on the problem of isomorphisms of polynomials, which can resist quantum attack, and gave its security proof under the random oracle model. In the proposed scheme, the message can be kept blind by using the hash function, and the delegatee’s identity can be kept anonymous by using the problem of isomorphisms of polynomials. Compared with the existing schemes, the new scheme has more secure properties, such as quantum resistance, high efficiency, message blindness, and delegatee anonymity. It is concluded that the proposed scheme has a good application prospect in the future quantum computing environment with low-power hardware.

A Public-key Cryptography Base on Braid Group

After the quantum computing attack algorithm was proposed, the traditional public key cryptosystem makes people feel uneasy. So, looking for a quantum computer era can still guarantee a secure password system is a very meaningful work. In this paper, we introduce the theory of braided group, and use the left standard type and D.H. key exchange protocol of braided group to design a cryptosystem that can resist quantum attack. In the absence of any sacrifice, an algorithm is improved to make the algorithm more symmetrical and more efficient. We write the program used C++, compiled in Linux, and test it successful.

Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud

Multimedia cloud is novel computation paradigm which could leverage cloud infrastructure to store large quantity of multimedia documents and respond on the requests from customers. With the development of multimedia cloud, an increasing attention is paid to its privacy and security issues. Searchable encryption (SE) technology could protect the sensitive information of cloud storage data and at the same time allow keyword search query. Most of the available SE schemes are constructed using the bilinear map. However, both discrete logarithms and factorization are proved to be solved by quantum computer in a polynomial time. Thus, those schemes are not secure in quantum age. Moreover, majority SE schemes are limited in exact or fuzzy keyword search. They can not support the semantically keyword equivalent judgement. In order to solve those problems, we suggest a novel data retrieval scheme for multiple users based on the lattice based mechanism. The contribution of this paper is summarized in three aspects: lattice assumption based scheme to resist quantum attack, semantically keyword search to enable synonym query and broadcast encryption based mechanism to support multiple user system without sharing secret key. This scheme is a candidate for secure multimedia cloud even in quantum-era since the LWE problem is secure against quantum attack.

Attribute-based signatures on lattices

Because of its wide application in anonymous authentication and attribute-based messaging, the attribute-based signature scheme has attracted the public attention since it was proposed in 2008. However, most of the existing attribute-based signature schemes are no longer secure in quantum era. Fortunately, lattice-based cryptography offers the hope of withstanding quantum computers. And lattices has elevated it to the status of a promising potential alternative to cryptography based on discrete log and factoring, owing to implementation simplicity, provable security reductions and quantum-immune. In this paper, the first lattice attribute-based signature scheme in random oracle model is proposed, which is proved existential unforgeability and perfect privacy. Compared with the current attribute-based signature schemes, our new attribute-based signature scheme can resist quantum attacks and has much shorter public-key size and signature size. Furthermore, this scheme is extended into an attribute-based signature scheme on number theory research unit (NTRU) lattice, which is also secure even in quantum era and has much higher efficiency than the former.

Forward-Secure Identity-Based Shorter Blind Signature from Lattices

Blind signature (BS) plays one of key ingredients in electronic cash or electronic voting system. However, the key exposures bring out very serious problems in insecure mobile devices. Forward-secure blind signatures preserve the validity of past signatures and prevent a forger from forging past signatures even if current secret key has been compromised. In this paper, we propose the first forward-secure identity-based shorter blind signature scheme from lattices which can resist quantum attack, and prove that our scheme satisfies the security requirements of blindness, unforgeability, and forward secrecy in the random oracle model. Furthermore, we also extend our construction to a forward-secure identity-based shorter blind signature in the standard model.

An attribute-based signature scheme from lattice assumption

Inspired by the framework of Boyen, in this paper, an attribute-based signature (ABS) scheme from lattice assumption is proposed. In this attribute-based signature scheme, an entity’s attributes set corresponds to the concatenation of a lattice matrix with the sum of some random matrices, and the signature vector is generated by using the Preimage Sampling algorithm. Compared with current attribute-based signature schemes, this scheme can resist quantum attacks and enjoy shorter public-key, smaller signature size and higher efficiency.

Attribute-based signature on lattices

Attribute-based signature is a versatile class of digital signatures. In attribute-based signature, a signer obtains his private key corresponding to the set of his attributes from a trusted authority, and then he can sign a message with any predicate that is satisfied by his attributes set. Unfortunately, there does not exist an attributebased signature which is resistance to the quantum attacks. This means we do not have secure attribute-based signature schemes in a post-quantum world. Based on this consideration, an attribute-based signature on lattices, which could resist quantum attacks, is proposed. This scheme employs “bonsai tree” techniques, and could be proved secure under the hardness assumption of small integer solution problem.

Efficient forward secure identity-based shorter signature from lattice

All regular cryptographic schemes rely on the security of the secret key. However, with the explosive use of some relatively insecure mobile devices, the key exposure problem has become more aggravated. In this paper, we propose an efficient forward secure identity-based signature (FSIBS) scheme from lattice assumption, with its security based on the small integer solution problem (SIS) in the random oracle model. Our scheme can guarantee the unforgeability of the past signatures even if the current signing secret key is revealed. Moreover, the signature size and the secret key size of our scheme are unchanged and much shorter. To the best of our knowledge, our construction is the first FSIBS scheme based on lattice which can resist quantum attack. Furthermore, we extend our FSIBS scheme to a forward secure identity-based signature scheme in the standard model.

Hash Proof System Based on Lattice

We present a hash proof systems (HPS)based on hard lattice problems including learning with error (LWE) and inhomogeneous small integer solution (ISIS). Different from the HPS in past, ours is with error. That is to say, the deterministic private evaluation algorithm is not always equivalent to the deterministic public evaluation algorithm. The difference between them is one or zero. We also show how to construct a public-key encryption scheme which is semantically secure against key-leakage attacks in the standard model using our HPS based on lattice. Compared with previous cryptosystem based on lattice, our construction needs bigger public key space but fewer operations during encryption, and can resist quantum attacks because of the assumption on lattice problem.