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.
Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to almost any known cryptographic object. So far, candidate IO constructions were based on specific assumptions on algebraic objects called multi-linear graded encodings. We present a generic construction of indistinguishability obfuscation from public-key functional encryption with succinct cipher texts and...
Bio-cryptography represents a relative new and emerging domain, which proposes to strengthen the usual biometric systems, by adding the traditional cryptography layer to their architecture. Its main benefit lies in the elimination of the need for storing enrolled users biometric templates. Although bio-cryptographic algorithms confer a certain level of security, their main disadvantage is the high...
Multi-recipient encryption is an important public key cryptosystem, which can be applied for a variety of purposes, such as broadcasting data. In order to design an secure multi-recipient public key encryption (MRPKE) in post-quantum era, in this paper, we construct a novel MRPKE scheme base on Garg-Gentry-Halevi (GGH) framework which is a graded algebras analogue of multilinear maps from ideal lattice...
In this article we describe two alternative order-preserving encryption schemes. First scheme is based on arithmetic coding and the second scheme uses sequence of matrices for data encrypting. In the beginning of this paper we briefly describe previous related work published in recent time. Then we propose alternative variants of OPE and consider them in details. We examine drawbacks of these schemes...
Yao's garbled circuit construction transforms a boolean circuit $C:\{0,1\}^n\to\{0,1\}^m$ into a ``garbled circuit'' along with pairs of $k$-bit keys, one for each input bit, such that together with the keys corresponding to an input reveal $C(x)$ and no additional information about $x$. The garbled circuit construction is a central tool for constant-round secure computation...
The Euler totient function and Euler-Fermat theorem utilised in the RSA scheme are extended from the integers to polynomials over finite fields. The new scheme is suited for both privacy and authentication implementations, as is its predecessor. The security of the system rests in part on the difficulty of determining the degrees of the irreducible factors of a high-degree polynomial.
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.