Fully Secure Identity-based Broadcast Encryption in the Subgroups

In this paper,we show how to use the dual techniques in the subgroups to give a secure identity-based broadcast encryption(IBBE) scheme with constant-size ciphertexts. Our scheme achieves the full security(adaptive security) under three static(i.e. non q-based) assumptions. It is worth noting that only recently Waters gives a short ciphertext broadcast encryption system that is even adaptively secure under the simple assumptions. One feature of our methodology is that it is relatively simple to leverage our techniques to get adaptive security.

High Security for De-Duplicated Big Data Using Optimal SIMON Cipher

Cloud computing offers internet location-based affordable,scalable,and independent services.Cloud computing is a promising and a cost-effective approach that supports big data analytics and advanced applications in the event of forced business continuity events,for instance,pandemic situations.To handle massive information,clusters of servers are required to assist the equipment which enables streamlining the widespread quantity of data,with elevated velocity and modified configurations.Data deduplication model enables cloud users to efficiently manage their cloud storage space by getting rid of redundant data stored in the server.Data deduplication also saves network bandwidth.In this paper,a new cloud-based big data security technique utilizing dual encryption is proposed.The clustering model is utilized to analyze the Deduplication process hash function.Multi kernel Fuzzy C means(MKFCM)was used which helps cluster the data stored in cloud,on the basis of confidence data encryption procedure.The confidence finest data is implemented in homomorphic encryption data wherein the Optimal SIMON Cipher(OSC)technique is used.This security process involving dual encryption with the optimization model develops the productivity mechanism.In this paper,the excellence of the technique was confirmed by comparing the proposed technique with other encryption and clustering techniques.The results proved that the proposed technique achieved maximum accuracy and minimum encryption time.

Key continual-leakage resilient broadcast cryptosystem from dual system in broadcast networks

In order to tolerate possible leakage of secret keys, leakage-resilient cryptosystem models a class of attractive leakage output by allowing an adversary to provide any computable leakage function and learning the partial keys or other possible intemal states from the output of function. In this work, we present an adaptively secure broadcast encryption resilient to key continual leakage in the standard model. Our scheme provides the tolerance of continual leakage, in which any user can generate multiple private keys per user by periodically updating the key. We use the dual system encryption mechanism to implement the leakage resilience and adaptive security, and intrinsically set an algorithm to refresh a key and produce a same distributed new key. We also give the evaluation of the leakage bound and leakage fraction, and the simulations show that our scheme can tolerate about 71% leakage fraction with 3.34× 10^-52 failure probability in standard 80-bit security level when we adjust the leakage factor to allow the private key to be 100 Kb.

(Identity-based)dual receiver encryption from lattice-based programmable hash functions with high min-entropy

Dual receiver encryption(DRE)is an important cryptographic primitive introduced by Diament et al.at CCS’04,which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext.This primitive is quite useful in designing combined public key cryptosystems and denial of service attack-resilient protocols.In this paper,we obtain some results as follows.·Using weak lattice-based programmable hash functions(wLPHF)with high min-entropy(Crypto’16),we give a generic IND-CCA secure DRE construction in the standard model.Furthermore,we get a concrete DRE scheme by instantiating a concrete wLPHF with high min-entropy.·For DRE notion in the identity-based setting,identity-based DRE(IB-DRE),basing on lattice-based programmable hash functions(LPHF)with high min-entropy,we give a framework of IND-ID-CPA secure IB-DRE construction in the standard model.When instantiating with concrete LPHFs with high min-entropy,we obtain five concrete IB-DRE schemes.

(Identity-based)dual receiver encryption from lattice-based programmable hash functions with high min-entropy

Dual receiver encryption(DRE)is an important cryptographic primitive introduced by Diament et al.at CCS’04,which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext.This primitive is quite useful in designing combined public key cryptosystems and denial of service attack-resilient protocols.In this paper,we obtain some results as follows.·Using weak lattice-based programmable hash functions(wLPHF)with high min-entropy(Crypto’16),we give a generic IND-CCA secure DRE construction in the standard model.Furthermore,we get a concrete DRE scheme by instantiating a concrete wLPHF with high min-entropy.·For DRE notion in the identity-based setting,identity-based DRE(IB-DRE),basing on lattice-based programmable hash functions(LPHF)with high min-entropy,we give a framework of IND-ID-CPA secure IB-DRE construction in the standard model.When instantiating with concrete LPHFs with high min-entropy,we obtain five concrete IB-DRE schemes.

New Constructions of Dynamic Threshold Cryptosystem

This study deals with the dynamic property of threshold cryptosystem. A dynamic threshold cryptosystem allows the sender to choose the authorized decryption group and the threshold value for each message dynamically. We first introduce an identity based dynamic threshold cryptosystem, and then use the CanettiHalevi-Katz(CHK) transformation to transform it into a fully secure system in the traditional public key setting.Finally, the elegant dual system encryption technique is applied to constructing a fully secure dynamic threshold cryptosystem with adaptive security.

Fully Secure Revocable Attribute-Based Encryption

Distributed information systems require complex access control which depends upon attributes of protected data and access policies.Traditionally,to enforce the access control,a file server is used to store all data and act as a reference to check the user.Apparently,the drawback of this system is that the security is based on the file server and the data are stored in plaintext.Attribute-based encryption(ABE) is introduced first by Sahai and Waters and can enable an access control mechanism over encrypted data by specifying the users’ attributes. According to this mechanism,even though the file server is compromised,we can still keep the security of the data. Besides the access control,user may be deprived of the ability in some situation,for example paying TV.More previous ABE constructions are proven secure in the selective model of security that attacker must announce the target he intends to attack before seeing the public parameters.And few of previous ABE constructions realize revocation of the users’ key.This paper presents an ABE scheme that supports revocation and has full security in adaptive model.We adapt the dual system encryption technique recently introduced by Waters to ABE to realize full security.

Predicate encryption against master-key tampering attacks

Many real world attacks often target the implementation of a cryptographic scheme,rather than the algorithm itself,and a system designer has to consider new models that can capture these attacks.For example,if the key can be tampered by physical attacks on the device,the security of the scheme becomes totally unclear.In this work,we investigate predicate encryption(PE),a powerful encryption primitive,in the setting of tampering attacks.First,we show that many existing frameworks to construct PE are vulnerable to tampering attacks.Then we present a new security notion to capture such attacks.Finally,we take Attrapadung’s framework in Eurocrypt’14 as an example to show how to"compile"these frameworks to tampering resilient ones.Moreover,our method is compatible with the original pair encoding schemes without introducing any redundancy.

Predicate encryption against master-key tampering attacks

Many real world attacks often target the implementation of a cryptographic scheme,rather than the algorithm itself,and a system designer has to consider new models that can capture these attacks.For example,if the key can be tampered by physical attacks on the device,the security of the scheme becomes totally unclear.In this work,we investigate predicate encryption(PE),a powerful encryption primitive,in the setting of tampering attacks.First,we show that many existing frameworks to construct PE are vulnerable to tampering attacks.Then we present a new security notion to capture such attacks.Finally,we take Attrapadung’s framework in Eurocrypt’14 as an example to show how to“compile"these frameworks to tampering resilient ones.Moreover,our method is compatible with the original pair encoding schemes without introducing any redundancy.