verifiable delegation

Top PDF verifiable delegation:

Circuit Ciphertext Policy Attribute Based Hybrid Encryption with Verifiable Delegation in Cloud Computing
Ch Ramesh Kumar & K Saddam Hussain

Circuit Ciphertext Policy Attribute Based Hybrid Encryption with Verifiable Delegation in Cloud Computing Ch Ramesh Kumar & K Saddam Hussain

Page 1769 Circuit Ciphertext Policy Attribute Based Hybrid Encryption with Verifiable Delegation in Cloud Computing Ch Ramesh Kumar Associate Professor & HOD, Department of CSE, Malla Reddy Engineerin[.]

6 Read more

Verifiable Delegation In Cloud Computing Using Ciphertext Policy Attribute Based Hybrid Encryption

Verifiable Delegation In Cloud Computing Using Ciphertext Policy Attribute Based Hybrid Encryption

independently without knowing anything about his GID. In this Paper, we referred the solution the first decentralized ABE scheme with privacy-preserving based on standardcomplexity assumptions. 3. Securely outsourcing attribute- based encryption with checkability J. Li, X. Huang, J. Li, X. Chen, and Y. Xiang. This paper proposes anoutsourced ABE construction which providescheckability of the outsourced computation results in an efficient way. Extensive Security and performance analysis show that the proposed schemes are proven secure and practical. In this Paper, we referred the solution ABE with verifiable delegation. Since the introduction of ABE, there have been advances in multiple directions. 4. A new paradigm of hybridencryption scheme K. Kurosawa and Y. Desmedt. In this paper, we show that a key encapsulation mechanism (KEM) does not have to be IND-CCA secure in the construction of hybrid encryption schemes, as was previously believed In this Paper, we have referred the solution to develop the KEM/DEM model for hybrid encryption. 5. A practical public key cryptosystemprovably secure against adaptive chosen ciphertext attack R. Cramer and V. Shoup. A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosenciphertext attack under
Show more

6 Read more

Circuit Ciphertext-Policy Attribute-Based Hybrid Encryption with Verifiable Delegation in Cloud Computing

Circuit Ciphertext-Policy Attribute-Based Hybrid Encryption with Verifiable Delegation in Cloud Computing

ABSTRACT: In the cloud, for achieving access control and data security, the data owners could uses attribute-based encryption to encrypt the stored data. To reduce the cost, the userswhich has a limited computing power are nevertheless more likely to delegate the mask of the decryption task to the cloud servers. The result shows, attribute- based encryption with delegation come out. Still, there are some problems and questions regarding to previous related works. For example, during the delegation or release, the cloud servers could misrepresent or replace the delegated ciphertext and respond a fake result with malevolent intent. As well as for the purpose of cost saving the cloud server may also fraud the eligible users by responding them that they are unworthy. Even, the access policies may not be flexible during the encryption. Since policy for general circuits are used to achieve the strongest form of access control, a construction to design circuit ciphertext-policy attribute-based hybrid encryption with verifiable delegation has been developed. This system is mixed with verifiable computation and encrypt-then-Mac mechanism, the data confidentiality, the fine-grained access control as well as the correctness of the delegated computing results are well guaranteed at the same time. As well as this scheme achieves security against chosen-plaintext attacks under the k- multilinear Decisional Diffie-Hellman assumption. Moreover, this scheme achieves feasibilityas well as efficiency.
Show more

6 Read more

Circuit CP-ABE with Fine Grained Access Control and Verifiable Delegation in Cloud Computing

Circuit CP-ABE with Fine Grained Access Control and Verifiable Delegation in Cloud Computing

A circuit ciphertext-policy attribute-based hybrid encryption with verifiable delegation scheme is presented, circuits are used to state the secure type of access control policy. Certifiable computation and encrypt-then-mac mechanism are combined with ciphertext-policy attribute-based hybrid encryption and assign the verifiable partial decryption paradigm to the cloud server. The expenses of the computation and communique consumption show that the scheme is useful in the cloud computing. For that reason, it might be significant to make sure the data confidentiality.
Show more

6 Read more

Attribute Based Hybrid Encryption with Verifiable Delegation in Cloud Computing Using Circuit Ciphertext-Policy

Attribute Based Hybrid Encryption with Verifiable Delegation in Cloud Computing Using Circuit Ciphertext-Policy

To the best of our erudition, we firstly present a circuit ciphertext-policy attribute- predicated hybrid encryption with verifiable delegation scheme. General circuits are acclimated to express the most vigorous form of access control policy. Coalesced verifiable computation and encrypt-then-

6 Read more

An Efficient Fine-Grained Access Control and the Verifiable Delegation in Cloud Computing

An Efficient Fine-Grained Access Control and the Verifiable Delegation in Cloud Computing

We conclude that during this paper we present a circuit ciphertext-coverage attribute-based hybrid encryption with verifiable delegation scheme. General circuits are used to express the most powerful shape of get admission to manipulate policy. Combined verifiable computation and encrypt-then-mac mechanism with our ciphertext- insurance characteristic-based hybrid encryption, we may additionally want to delegate the verifiable partial decryption paradigm to the cloud server. In addition, the proposed scheme is proven to be secured primarily based on k-multilinear Decisional Diffie-Hellman assumption.
Show more

6 Read more

Data sharing Suing ABE verifiable delegation authentication confidentiality

Data sharing Suing ABE verifiable delegation authentication confidentiality

In this section, we present the definition and security model of our hybrid VD-CPABE. In such a system, a circuit ciphertext-policy attribute-based encryption scheme, a symmetric encryption scheme and an encrypt-then-mac mechanism are applied to ensure the confidentiality, the fine-grained access control and the verifiable delegation A hybrid VD-CPABE scheme is defined by a tuple of algorithms (Setup, Hybrid- Encrypt, Key- Gen, Transform, Verify- Decrypt). The description of each algorithm

7 Read more

Verifiable Delegation in Cloud Computing Using Ciphertext Policy Attribute Based Hybrid Encryption

Verifiable Delegation in Cloud Computing Using Ciphertext Policy Attribute Based Hybrid Encryption

providescheckability of the outsourced computation results in an efficient way. Extensive Security and performance analysis show that the proposed schemes are proven secure and practical. In this Paper, we referred the solution ABE with verifiable delegation. Since the introduction of ABE, there have been advances in multiple directions. 4. A new paradigm of hybridencryption scheme K. Kurosawa and Y. Desmedt. In this paper, we show that a key encapsulation mechanism (KEM) does not have to be IND-CCA secure in the construction of hybrid encryption schemes,
Show more

7 Read more

Circuit Cipher text-Policy Attribute-Based Hybrid Encryption with Verifiable Delegation in Cloud Computing

Circuit Cipher text-Policy Attribute-Based Hybrid Encryption with Verifiable Delegation in Cloud Computing

attribute-based encryption (CP-ABE) is used to guarantee the data privacy and the verifiability of allocation on untruthful cloud servers. Captivating health check data distribution as an example among the rising volumes of health check images and health check records, the medical care associations set a big amount of data in the cloud for dropping. To make such data sharing be achievable, attribute based encryption is used. There are two forms of attribute-based encryption. One is key-policy attribute- based encryption (KP-ABE) and the second is ciphertext-policy attribute-based encryption. In CP-ABE system, each ciphertext is contains an access structure, and each private key is labeled with a set of descriptive attributes. A user is able to decrypt a ciphertextif and only if the key’s attribute set satisfies the access structure associated with a ciphertext. The cloud server provides another service which is delegation computing.The VD-CPABE schemeshows that the untrusted cloud will not be able to learn anything about the encrypted message and build the original ciphertext.
Show more

7 Read more

On  Publicly  Verifiable  Delegation  From  Standard  Assumptions

On Publicly Verifiable Delegation From Standard Assumptions

While the group structure and bilinear map enable public verification, they only support a limited set of homomorphic operations, namely quadratic polynomials. As a result, we can only handle protocols where both the prover and verifier strategies only evaluate quadratic polynomials over random elements. In particular, to handle the sum-check and GKR protocols, where the prover and verifier’s strategies have degree above 2, we need to include all the monomials as part of the CRS which results in a long CRS. Delegation from linear PCPs. The work of [BCI + 13] shows how to convert linear PCPs into publicly verifiable non-interactive delegation schemes. In a linear PCP the answers are obtained by applying a linear function to the queries. Their work considers linear PCPs where the verification has degree 2 in the queries and their answers. They transform such a PCP into a delegation protocol by encoding the verifier’s PCP queries in the exponent of a group with a bilinear map. Our protocols can be described in a similar framework. Specifically, the interactive GKR prover just evaluates a low-degree polynomial over the verifier queries. By changing the verifier’s queries to include all possible monomials, we can think of the prover strategy as a linear PCP. In our protocol the CRS contains an encodings of this extended query.
Show more

33 Read more

Hide  The  Modulus:  A  Secure  Non-Interactive  Fully  Verifiable  Delegation  Scheme  for  Modular  Exponentiations  via  CRT

Hide The Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT

Abstract. Security protocols using public-key cryptography often requires large number of costly modular exponentiations (MEs). With the proliferation of resource-constrained (mobile) devices and advancements in cloud computing, delegation of such expensive com- putations to powerful server providers has gained lots of attention. In this paper, we ad- dress the problem of verifiably secure delegation of MEs using two servers, where at most one of which is assumed to be malicious (the OMTUP-model). We first show verifiabil- ity issues of two recent schemes: We show that a scheme from IndoCrypt 2016 does not offer full verifiability, and that a scheme for n simultaneous MEs from AsiaCCS 2016 is verifiable only with a probability 0.5909 instead of the author’s claim with a probabil- ity 0.9955 for n = 10. Then, we propose the first non-interactive fully verifiable secure delegation scheme by hiding the modulus via Chinese Remainder Theorem (CRT). Our scheme improves also the computational efficiency of the previous schemes considerably. Hence, we provide a lightweight delegation enabling weak clients to securely and verifiably delegate MEs without any expensive local computation (neither online nor offline). The proposed scheme is highly useful for devices having (a) only ultra-lightweight memory, and (b) limited computational power (e.g. sensor nodes, RFID tags).
Show more

23 Read more

Verifiable Delegation of Computation through Fully Homomorphic Encryption

Verifiable Delegation of Computation through Fully Homomorphic Encryption

An essential property of a VC scheme is correctness. A scheme is correct if the problem generation algorithm produces values that allow an honest worker to compute values that will verify successfully and correspond to the evaluation of F on those inputs. All VC schemes should be secure, that is a malicious worker cannot manipulate the verification algorithm to accept an incorrect output. The efficiency condition required from a VC scheme is that the time to encode the input and verify the output must be smaller than the time to compute the function from scratch. Input privacy is defined based on a typical indistinguishability argument that guarantees that no information about the inputs is leaked. Public delegation allows decoupling the party who provides the function to be evaluated and the party who has the input for the computation. That is, the delegator chooses from the functions which are made publicly available by a third party. Public verifiability enables anyone to verify the correctness of the returned results. That is, the role of prover can be separated from the role of delegator, without sharing additional secret information. A recent survey of VC approaches and open problems are described in [10].
Show more

6 Read more

Efficient Access Control and verifiable delegation in cloud with Utilizing Cipher Text-Policy Attribute-Based Hybrid Encryption

Efficient Access Control and verifiable delegation in cloud with Utilizing Cipher Text-Policy Attribute-Based Hybrid Encryption

ABE with Verifiable Appointment. Since the presentation of ABE, there have been propels in numerous ways. The use of outsourcing calculation is one of a vital course. The initially ABE with outsourced unscrambling plan to diminish the calculation cost amid decoding. The meaning of ABE with evident outsourced unscrambling. They try to ensure the accuracy of the first figure message by utilizing a duty. Be that as it may, since the information proprietor creates a duty with no mystery esteem about his personality, the un trusted server would then be able to fashion a dedication for a message he picks. In this way the figure content
Show more

7 Read more

Publicly  Verifiable  Delegation  of  Large  Polynomials   and  Matrix  Computations,  with  Applications

Publicly Verifiable Delegation of Large Polynomials and Matrix Computations, with Applications

Abstract. Outsourced computations (where a client requests a server to perform some computation on its behalf) are becoming increasingly important due to the rise of Cloud Computing and the proliferation of mobile devices. Since cloud providers may not be trusted, a crucial problem is the verification of the integrity and correctness of such computation, possibly in a public way, i.e., the result of a computation can be verified by any third party, and requires no secret key – akin to a digital signature on a message. We present new protocols for publicly verifiable secure outsourcing of Evaluation of High Degree Polyno- mials and Matrix Multiplication. Compared to previously proposed solutions, ours improve in efficiency and offer security in a stronger model. The paper also discusses several practical applications of our protocols.
Show more

25 Read more

Title: Achieving Access Control and Data Confidential by Attribute-Based-Hybrid Encryption in Cloud Computing

Title: Achieving Access Control and Data Confidential by Attribute-Based-Hybrid Encryption in Cloud Computing

this computing environments, the cloud servers offer various data services, like remote data storage and outsourced delegation computation. For data storage, the servers store a large amount of shared data, which could be only accessed by authorized users. For delegation computation, the servers could be used to handle and calculate various data according to the user’s requests. As applications move to cloud computing ciphertext-policy-attribute-based encryption (CP-ABE) and verifiable delegation (VD) are used to ensure the data confidentiality and the verifiability of delegation on dishonest cloud servers.
Show more

6 Read more

Fully  Verifiable  Secure  Delegation  of  Pairing  Computation:  Cryptanalysis   and  An  Efficient  Construction

Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction

Chevallier-Mames et al. [20] introduced the first fully verifiable delegation scheme for pairings under the OUP model which later be improved by Kang et al. [28] and Canard et al. [15]. As pointed out by Chen et al. [18] the main drawback of these schemes is the replacement of the pairing computation with a scheme executing the comparably costly interactive computations of modular exponenti- ations and elliptic curve scalar multiplications. This contradicts inherently with the major goal of secure delegation stemming originally from the realizability, practicality and usability considerations. With the aim of practically feasible secure delegation of pairing computation, Chen et al. [18] proposed the first ef- ficient delegation scheme under the OMTUP assumption without requiring any interactive computation of modular exponentiations and elliptic curve scalar multiplications of the delegator. Tian et al. [44] and Arabaci et al. [2] improved the computational overhead of this scheme further. The major drawback of these schemes is however that an untrusted program could cheat the delegator with probability 1/2 contradicting substantially with the desired verifiability of the delegated computation. Almost at the same time, the first secure delegation scheme with adjustable verifiability is proposed by Kiraz and Uzunkol [29] in the context of group exponentiations under the OUP model. Like [29], Tian et al. [44] proposed for the first time a pairing delegation scheme with the ad- justable verifiability probability (1 − 1/3s) 2 under the TUP model, where s is a
Show more

37 Read more

A Novel Key-Policy Attribute-Based Encryption Schema with Verifiable Computation in Cloud

A Novel Key-Policy Attribute-Based Encryption Schema with Verifiable Computation in Cloud

As applications move to cloud computing platforms, ciphertext-policy attribute-based encryption (CP-ABE) and verifiable delegation (VD) are used to ensure the data confidentiality and the verifiability of delegation on dishonest cloud servers. There are two complementary forms of attribute-based encryption. One is key-policy attribute-based encryption (KP-ABE) and the other is ciphertext-policy attribute-based encryption (CP-ABE). In a KP-ABE system, the decision of access policy is made by the key distributor instead of the enciphered, which limits the practicability and usability for the system in practical applications. On the contrary, in a CP-ABE system, each ciphertext is associated with an access structure, and each private key is labelled with a set of descriptive attributes. A user is able to decrypt a ciphertext if the key’s at-tribute set satisfies the access structure associated with a ciphertext. Apparently, this system is conceptually closer to traditional access control methods. On the other hand, in a ABE system, the access policy for general circuits could be regarded as the strongest form of the policy expression that circuits can express any program of fixed running time.
Show more

5 Read more

A Novel Key-Policy Attribute-Based Encryption Schema with Verifiable Computation in Cloud

A Novel Key-Policy Attribute-Based Encryption Schema with Verifiable Computation in Cloud

As applications move to cloud computing platforms, ciphertext-policy attribute-based encryption (CP-ABE) and verifiable delegation (VD) are used to ensure the data confidentiality and the verifiability of delegation on dishonest cloud servers. There are two complementary forms of attribute-based encryption. One is key-policy attribute-based encryption (KP-ABE) and the other is ciphertext-policy attribute-based encryption (CP-ABE). In a KP-ABE system, the decision of access policy is made by the key distributor instead of the enciphered, which limits the practicability and usability for the system in practical applications. On the contrary, in a CP-ABE system, each ciphertext is associated with an access structure, and each private key is labelled with a set of descriptive attributes. A user is able to decrypt a ciphertext if the key’s at-tribute set satisfies the access structure associated with a ciphertext. Apparently, this system is conceptually closer to traditional access control methods. On the other hand, in a ABE system, the access policy for general circuits could be regarded as the strongest form of the policy expression that circuits can express any program of fixed running time.
Show more

5 Read more

DETERMINANTS OF DELEGATION OF DUTIES  AND RESPONSIBILITIES  IN THE ADMINISTRATION OF SECONDARY SCHOOLS IN MBEERE SOUTH SUB COUNTY, EMBU COUNTY, KENYA

DETERMINANTS OF DELEGATION OF DUTIES AND RESPONSIBILITIES IN THE ADMINISTRATION OF SECONDARY SCHOOLS IN MBEERE SOUTH SUB COUNTY, EMBU COUNTY, KENYA

A study by Abdille (2012) in public secondary schools on delegation of duties inMandela East District found out that the function of classroom observation was neglected even in the event of having adequate staffing levels. It thus negates the essence of according the responsibility of instructional supervision to head teachers. The research argues that the head teachers should empower and delegate instructional supervisory roles to subject panels, departmental heads and senior teachers. Okumbe (1998) says that although educational organizations are bureaucratic, the teachers who occupy the bottom of the hierarchy are highly educated professionals, sometimes even more educated than the head- teachers are. According to Koontz and Weinhrichn (1998), managers should be receptive and willing to give other peoples’ ideas a chance. They further say that decision-making involves some discretion and subordinate’s ideas may differ from those of managers. Orora (2007) adds that poor delegation makes the chief executive the only member of an enterprise. In addition, an enterprise’s plans, decisions and tasks are enormous and any attempt by anyone to operate them singly leads to failure.
Show more

9 Read more

Unique  Signature  with  Short  Output  from  CDH  Assumption

Unique Signature with Short Output from CDH Assumption

5. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. J. Cryp- tol. 17(4), 297–319 (Sep 2004), http://dx.doi.org/10.1007/s00145-004-0314-9 6. Boneh, D., Shen, E., Waters, B.: Strongly unforgeable signatures based on com- putational diffie-hellman. In: Proceedings of the 9th International Conference on Theory and Practice of Public-Key Cryptography. pp. 229–240. PKC’06, Springer- Verlag, Berlin, Heidelberg (2006), http://dx.doi.org/10.1007/11745853_15 7. Dodis, Y.: Efficient construction of (distributed) verifiable random functions. In:

20 Read more

Show all 763 documents...