For practical data sharing applications, many attributebased encryption (ABE) schemes were proposed with different kinds of properties, such as supporting large universe, revocation, verification and so on. However, existing schemes seldom support these three important properties simultaneously. In this paper, we present a directly revocable and verifiable key-policy ABE scheme for large univer...

We propose adaptively secure attribute-based encryption (ABE) schemes for boolean formulas over large universe attributes from the decisional linear (DLIN) assumption, which allow an arbitrary number of attribute reuse in an available formula without the previously employed redundant multiple encoding technique. Based on the key-policy (KP)ABE scheme, we have an adaptively secure communication-...

In this work, we present HIBE and ABE schemes which are “unbounded” in the sensethat the public parameters do not impose additional limitations on the functionality of thesystems. In all previous constructions of HIBE in the standard model, a maximum hierarchydepth had to be fixed at setup. In all previous constructions of ABE in the standard model,either a small universe size o...

Inside a dispersed foriegn atmosphere, anyone receives a untrusted company which has a change for better crucial allowing this foriegn to turn any kind of ABE ciphertext fulfilled through the wearer's features. Stability of ABE technique with outsourced decryption makes certain that a foe (including any destructive cloud) aren't going to be capable to study everything about the encrypted meanin...

Recently, cryptographic access control has received a lot of attention, mainly due to the availability of efficient Attribute-Based Encryption (ABE) schemes. ABE allows to get rid of a trusted reference monitor by enforcing access rules in a cryptographic way. However, ABE has a privacy problem: The access policies are sent in clear along with the ciphertexts. Further generalizing the idea of p...

We propose new fully secure attribute based encryption (ABE) systems for polynomialsize circuits in both key-policy and ciphertext-policy flavors. All the previous ABE systems for circuits were proved only selectively secure. Our schemes are based on asymmetric graded encoding systems in composite-order settings. The assumptions consist of the Subgroup Decision assumptions and two assumptions w...

Attribute-based encryption (ABE) which allows users to encrypt and decrypt messages based on user attributes is a type of one-to-many encryption. Unlike the conventional one-to-one encryption which has no intention to exclude any partners of the intended receiver from obtaining the plaintext, an ABE system tries to exclude some unintended recipients from obtaining the plaintext whether they are...

In this work, we present HIBE and ABE schemes which are “unbounded” in the sense that the public parameters do not impose additional limitations on the functionality of the systems. In all previous constructions of HIBE in the standard model, a maximum hierarchy depth had to be fixed at setup. In all previous constructions of ABE in the standard model, either a small universe size or a bound on...

The acetone-butanol-ethanol (ABE) fermentation industry in China was started in the early 1950s in Shanghai and expanded rapidly thereafter. At its peak, there were about 30 plants all over the country and the total annual production of solvents reached 170,000 tons. This large enterprise was compelled to complete shutdown at the end of the 20th century due to the rapid increase of petrochemica...

Attribute-based encryption (ABE) is an extension of traditional public key encryption in which the encryption and decryption phases are based on user’s attributes. More precisely, we focus on ciphertext-policy ABE (CP-ABE) where the secret-key is associated to a set of attributes and the ciphertext is generated with an access policy. It then becomes feasible to decrypt a ciphertext only if one’...