40-bit encryption

About: 40-bit encryption is a research topic. Over the lifetime, 5434 publications have been published within this topic receiving 149016 citations.

Revocable identity-based encryption from lattices

Abstract: In this paper, we present an identity-based encryption (IBE) scheme from lattices with efficient key revocation. We adopt multiple trapdoors from the Agrawal-Boneh-Boyen and Gentry-Peikerty-Vaikuntanathan lattice IBE schemes to realize key revocation, which in turn, makes use of binary-tree data structure. Using our scheme, key update requires logarithmic complexity in the maximal number of users and linear in the number of revoked users for the relevant key authority. We prove that our scheme is selective secure in the standard model and under the LWE assumption, which is as hard as the worst-case approximating short vectors on arbitrary lattices.

Server with multiple encryption libraries

Abstract: A system, method and computer program product are provided for utilizing encrypter hardware with a server. Initially, an encryption layer module is run on a server. Such encryption layer module is capable of selecting an encryption algorithm from a library of encryption algorithms. In operation, the encryption layer module offloads a host processor of the server by executing the selected encryption algorithm using dedicated encrypter hardware.

Towards Acceptable Public-Key Encryption in Sensor Networks

Abstract: One of the huge problems for security in sensor networks is the lack of resources. Based on microcontroller architectures with severe limited computing abilities, strong public-key cryptography is commonly seen as infeasible on sensor devices. In contrast to this prejudice this paper presents an efficient and lightweight implementation of public-key cryptography algorithms relying on elliptic curves. The code is running on Atmels popular 8Bit ATMEGA128 microcontroller, the heart of the MICA2 platform.

Controlled Functional Encryption

Abstract: Motivated by privacy and usability requirements in various scenarios where existing cryptographic tools (like secure multi-party computation and functional encryption) are not adequate, we introduce a new cryptographic tool called Controlled Functional Encryption (C-FE). As in functional encryption, C-FE allows a user (client) to learn only certain functions of encrypted data, using keys obtained from an authority. However, we allow (and require) the client to send a fresh key request to the authority every time it wants to evaluate a function on a ciphertext. We obtain efficient solutions by carefully combining CCA2 secure public-key encryption (or rerandomizable RCCA secure public-key encryption, depending on the nature of security desired) with Yao's garbled circuit. Our main contributions in this work include developing and for- mally defining the notion of C-FE; designing theoretical and practical constructions of C-FE schemes achieving these definitions for specific and general classes of functions; and evaluating the performance of our constructions on various application scenarios.