Secure cloud storage service and limited proxy re-encryption for enforcing access control in public cloud

  title={Secure cloud storage service and limited proxy re-encryption for enforcing access control in public cloud},
  author={B. R. Purushothama and B. Shrinath and B. B. Amberker},
  journal={Int. J. Inf. Commun. Technol.},
Cloud computing is a new computing paradigm wherein the resources of the computing infrastructure are provided as services over the internet. The benefits offered by the public cloud encourage the data owners/organisations to store their data on to the cloud storage provided by the cloud storage provider. Cloud computing poses new security challenges as the users outsource their data to public cloud. Building a secure cloud storage service on top of a public cloud infrastructure where the… 
Provably secure public key cryptosystem with limited number of encryptions for authorised sharing of outsourced data
This paper addresses the problem of trust reduction on the untrusted cloud storage server to provide the authorised access to the outsourced data in public cloud environment, and coin the notion of public key cryptosystem with restriction on the number of encryptions.
A restricted proxy re‐encryption with keyword search for fine‐grained data access control in cloud storage
The formal syntax for restricted proxy re‐encryption with keyword search is presented, the security model, and a concrete construction are presented, and the scheme is proved to be semantically secure under the modified bilinear Diffie–Hellman assumption and the q‐decisional bilin EAR inversion assumption in the random oracle model.
A Limited Proxy Re-encryption with Keyword Search for Data Access Control in Cloud Computing
A new concept of limited proxy re-encryption with keyword search (LPREKS) for fine-grained data access control in cloud computing, which combines the function of limitedproxy re- Encryption and that of public key encryption with keywords search.
A Searchable Re-encryption Storage Method in Cloud Environment
Simulation results show that the proposed Searchable Re-encryption Storage Method introduced in this paper has better security and reliability.
Searchable Re-encryption Cloud Storage Method Based on Markov Chain
Simulation results show that SReCSM introduced in this paper has the ability to predict accurately when the size of the data is different and the influence of storage efficiency is reduced effectively through SRe CSM when different size ofThe data is stored in storage nodes regardless of the storage cost.
CCA Secure Unidirectional PRE with Key Pair in the Standard Model without Pairings
This work tackles the problem of designing a Proxy Re-Encryption that is unidirectional and CCA-secure in the standard model without pairings, and proposes a new construction based on Cramer-Shoup crypto-system, that is CCA secure without Pairings nor random oracle.
An Efficient Proxy Re-Encryption Based on (Semi) Group Factorization Problems
An efficient PRE scheme based on the intractability of the (semi) groupfactorization problems is proposed in this paper and the security of the proposed scheme is analyzed according to some conceivable attacks.
An exploratory case study on cloud ERP implementation
This study establishes the four crucial technical factors, from software engineering perspective, determining the performance of cloud ERP software found from the literature, and validate these factors in an organisation with successful cloud ERPs software system.
One of the possibilities how the company may built its competitive advantages is focusing on core business activities and other supporting (non - core) activities procures by external provi ders.


Proxy Re-Encryption Schemes with Proxy Having Its Own Public/Private Keys
It is found that if the proxy having its own public/private key is allowed, then the proxy can not act as malicious as the proxy in the traditional PRE, which somewhat make the authentication on the re-encrypted ciphertext no necessary again.
Improved proxy re-encryption schemes with applications to secure distributed storage
Performance measurements of the experimental file system demonstrate the usefulness of proxy re-encryption as a method of adding access control to a secure file system and present new re-Encryption schemes that realize a stronger notion of security.
Divertible Protocols and Atomic Proxy Cryptography
A definition of protocol divertibility is given that applies to arbitrary 2-party protocols and is compatible with Okamoto and Ohta's definition in the case of interactive zero-knowledge proofs and generalizes to cover several protocols not normally associated with divertibility.
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
A new public-key encryption scheme, along with several variants, is proposed and analyzed that appear to be the first public- key encryption schemes in the literature that are simultaneously practical and provably secure.
Digital Signature Schemes with Restriction on Signing Capability
The notion and the security model of c-times signature schemes, which restrict the signing ability of a signer up to c times for pre-defined value c at set-up, are formally defined.
Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop
This work introduces delegation schemes wherein a user may delegate certain rights to himself, but may not safely delegate these rights to others, without relying on special-purpose (e.g., tamper-proof) hardware.
A break in the clouds: towards a cloud definition
The concept of Cloud Computing is discussed to achieve a complete definition of what a Cloud is, using the main characteristics typically associated with this paradigm in the literature.
A public key cryptosystem and a signature scheme based on discrete logarithms
  • T. Elgamal
  • Computer Science, Mathematics
    CRYPTO 1985
  • 1985
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Universal Electronic Cash
The main advantage of the new system is that the customer can subdivide his cash balance into many pieces in any way he pleases until the total value of all subdivided piece equals C.
Untraceable Off-line Cash in Wallets with Observers (Extended Abstract)
The electronic cash scheme in [Fer93a] can be extended to provide n-spendable coins and observers can be incorporated in the protocols to provide prior restraint against double spending by the user, instead of just detection after the fact.