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...
Todays' era of internet-of-things, cloud computing and big data centers calls for more fresh graduates with expertise in digital data processing techniques such as compression, encryption and error correcting codes. This paper describes a project-based elective that covers these three main digital data processing techniques and can be offered to three different undergraduate majors electrical and...
Although pNE is a new and unique provably secure variant of famous NTRU cryptosystem so far, the message-expansion factor of pNE, similar to other variants of NTRU, is rather larger than that of other traditional public-key cryptosystems. In this paper, beside introducing RISKE, a new probabilistic secret-key cryptosystem based-on characteristics of invertible elements in binary truncated quotient...
Multiparty cloud computation can deal with the problem that the traditional homomorphic encryption can't operation on the ciphertexts generated by different users, and the final result is computed by cloud server. The trivial multiparty cloud computation doesn't take the access control to the final result into consideration. In reality, we perhaps do not want all parties to gain the result. In this...
These years attribute based encryption (ABE) is a very hot research topic for its very flexible control on the encrypted content. Typically, there are three parties in an attribute based encryption system: PKG, User (Decrypter), Encrypter. The PKG (Private Key Generator) is responsible to generate secret keys for the User (Decrypter) according to the attributes (CP-ABE) or the policy (KP-ABE), then...
When data owners store their data on cloud servers, they may want to define the access requirements themselves, where attribute-based authentication (ABA) can be a good choice for the solution. In this paper, we propose a traceable hierarchical ABA (HABA) solution which fits two situations in the cloud. The first situation is when cloud users are organized in groups of a hierarchical structure and...
Probabilistic key pre-distribution techniques for ad-hoc wireless sensor networks cannot guarantee link establishment and are prone to redundancy and key reuse. There is also a tradeoff between storage requirements, scalability and key reuse, which limits secure scalability. Master key an d Computation based key establishment techniques are vulnerable to clone attacks in case of compromised nodes...
The theoretical security that modern encryption algorithms are providing, leads researchers to new attack scenarios which are more implementation centric. By discovering hardware or software flaws that can recover some information about the decryption key, cryptanalysts try to exploit this knowledge. Therefore, many side channel attacks have appeared, illustrating that the concept of having secure...
Risk management practices, techniques and tools with respect to companies' supply chains have begun to receive more attention recently, as the need to improve supply chain performances has increased in order to keep the balance between financial considerations and those of the customer interests. With the multiplication of intermediate actors, a single threat at one point might compromise the safety...
Identity-based identification, first formalized independently by Bellare et al. and Kurosawa and Heng in 2004, still had the inherent key escrow problem, as the TA generating the user secret keys had full access to every user's secret key. In 2003, Al-Riyami and Paterson introduced the notion of certificateless cryptography, and subsequently many certificateless encryption, signature and other schemes...
In this paper, a novel reversible data hiding by using Reed-Solomon (RS) code is proposed for efficient transmission in encryption image. To increase the recovery of data from encrypted image, RS codes are used to encode messages, and then the code words can be embedded into encrypted image according to encryption key. After receiving embedding the code words, the receiver firstly decrypts the encrypted...
Several Elliptic Curve Processors (ECP) have been proposed in the literature associated with various architectures using different and sometimes confusing terminologies. This paper is a short review study of ECP architectures, considering the hardware platforms used for their implementations. The main design parameters of the ECP architectures, including the field choice and scalar multiplication...
Recently, the usage of GPU is not limited to the jobs associated with graphics and a wide variety of applications take advantage of the flexibility of GPUs to accelerate the computing performance. Among them, one of the most emerging applications is the fully homomorphic encryption (FHE) scheme, which enables arbitrary computations on encrypted data. Despite much research effort, it cannot be considered...
Energy-efficient data collection and privacy-preserving data recovery have received much attention recently. We propose the first encryption framework for the computation-intensive basis pursuit problem to be securely solved in the cloud with the data being efficiently collected using compressive sensing. We provide security and efficiency analyses to show the effectiveness of our method. Simulations...
This paper gives a theoretical background to dynamic generation of primitive polynomials, their usage in many fields including cryptography for a mobile communication systems. Presented polynomials and their generation over a Galois field is discussed. Additionally, the basic properties and arithmetic methods over finite fields of characteristic 3 are presented. The main objective of this paper is...
In this work, we present a multiple server fingerprint verification scheme that provides enhanced template security by eliminating several known vulnerabilities of the fuzzy vault scheme. We secure templates from adversarial attacks in honest-but-curious server scenarios by utilizing commutative encryption in which the raw fingerprint template is never used in matching or storage. In this system,...
In this paper we study involutions over a finite field of order 2n. We present some classes, several constructions of involutions and we study the set of their fixed points.
Cloud computing has been developed rapidly in recent years, and offers novel concepts and innovations in computer use. The applications of cloud computing are that people can put their data on cloud and also can designate a proxy to help them to execute a number of tasks in certain situations. The proxy re-encryption which is a cryptographic primitive has been proposed to solve this problem. In the...
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...
For the first time it is proposed a stream deniable-encryption algorithm. The algorithm generates cryptogram that is computationally indistinguishable from the cryptogram produced by some probabilistic encryption algorithm, called associated probabilistic algorithm, while ciphering a fake message with a fake key. When the sender and receiver of the message are coerced to open the encryption key, they...
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.