The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Homomorphic equality test is a process, which was present in CRYPTO'2014 as a tool of bootstrapping in an FHE, called AP14, and been used to test whether the plaintext of a given ciphertext is equal to a certain element. In fact, this powerful function induced many new applications about homomorphic encryption, in theory and practice, especially when homomorphic comparison and arithmetic functions...
Chosen ciphertext security (CCA security) is a very important security notion for public key encryption. Until now, there are numerous ways to construct CCA secure public key encryption (PKE) or key encapsulation mechanism (KEM) schemes. In this paper, we propose a new CCA secure Elgmal scheme, which is proved secure in the random oracle based on the CDH assumption, has almost no additional overhead...
Recently Vadim Lyubashevsky etc. built LWE problem on ring and proposed a public cryptosystem based on R-LWE, which, to a certain extent, solved the defect of large public key of this kind, but it didn't offer parameter selections and performance analysis in detail. In this paper an improved scheme is proposed by sharing a ring polynomial vector that makes public key as small as 1/m of the original...
Functional encryption provides more sophisticated and flexible relations between the encryption-key and decryption-key. Previous FE systems only allow for functionalities that take in a single authority key and plaintext as inputs. In this paper, a Multiple-Authority-Keys Attribute-Based Encryption system is presented. The new propose scheme allows descriptor to learn functionalities that take in...
In 1998, Blaze, Bleumer, and Strauss propose a kind of cryptographic primitive called proxy re-encryption. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice's public key into one that can be opene under Bob's decryption key. In 2007, mainly motivated b making different types of ciphertext circulate smoothly in the network, Matsuo proposed the concept of four types of...
Proxy re-encryption (PRE) allows a ciphertext computed under Alice's public key to be transformed to those which can be decrypted by Bob. Since Blaze et al. introduced the concept of proxy re-encryption in Eurocrypt'98, there are many results on proxy re-encryption. However, all the proxy re-encryption schemes proposed until now assume the proxy having no its own public/private keys. In this paper,...
In 1998, Blaze, Bleumer, and Strauss proposed a kind of cryptographic primitive called proxy re-encryption. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. In this paper, with the help of the PKG, we construct a CCA-secure identity based proxy reencryption scheme based on a variant of BBi identity...
In this paper, a parallel multi-recipient signcryption scheme called ParaSC-BLS is proposed, which is semantic secure in random oracle model assuming that the GDH problem is hard. With pre-computing, the speedup of ParaSC-BLS is up to N. As the number of recipients growing, the computational overheads of ParaSC-BLS are constant. For the randomness reusing, cipher text is aggregated and the total transmission...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.