Corpus ID: 12086628

Audit-Free Cloud Storage via Deniable

  title={Audit-Free Cloud Storage via Deniable},
  author={Po-Wen Chi and C. Lei}

Figures from this paper

How to Hide the Real Receiver Under the Cover Receiver: CP-ABE With Policy Deniability
This work applies the deniability concept to solve the problem of the encryption scheme that allows the sender to claim the ciphertext is for some receiver group while actually it is for another receiver group. Expand
Security and Privacy-Preserving Challenges of e-Health Solutions in Cloud Computing
The research challenges and directions concerning cyber security to build a comprehensive security model for EHR are highlighted and some crucial issues and the ample opportunities for advanced research related to security and privacy of EHRs are discussed. Expand
Security and Protection of Enterprise Data in Cloud: Implementation of Deniable CP-ABE algorithm and Performance Considerations
A new deniable ABE encryption scheme for cloud storage is proposed to ensure user privacy with minimized unauthorized access and a new ranking algorithm assigns a rank to each user at the time of registration based on their personal information enhances the privacy and provides access control to the data stored on cloud. Expand


Bi-Deniable Public-Key Encryption Protocol which is Secure against Active Coercive Adversary
We consider a practical public-key deniable encryption protocol based on the RSA cryptosystem. The protocol begins with the authentication of the both parties participating in the protocol (theExpand
A Ciphertext-Policy Attribute-Based Proxy Re-encryption with Chosen-Ciphertext Security
A new CP-ABPRE, constructed in the random oracle model, that can be proved CCA secure under the decisional q-parallel bilinear Diffie-Hellman exponent assumption and supports attribute-based re-encryption with any monotonic access structures. Expand
Hybrid Attribute- and Re-Encryption-Based Key Management for Secure and Scalable Mobile Applications in Clouds
Novel modifications to attribute-based encryption are proposed to allow authorized users access to cloud data based on the satisfaction of required attributes such that the higher computational load from cryptographic operations is assigned to the cloud provider and the total communication cost is lowered for the mobile user. Expand
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
A scheme for predicates corresponding to the evaluation of inner products over ℤN (for some large integer N) is constructed, which enables constructions in which predicates correspond to the Evaluation of disjunctions, polynomials, CNF/DNF formulas, thresholds, and more. Expand
Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
  • Brent Waters
  • Mathematics, Computer Science
  • Public Key Cryptography
  • 2011
We present a new methodology for realizing Ciphertext-Policy Attribute Encryption (CP-ABE) under concrete and noninteractive cryptographic assumptions in the standard model. Our solutions allow anyExpand
Deniable Encryption with Negligible Detection Probability: An Interactive Construction
This work proposes the first sender-deniable public key encryption system with a single encryption algorithm and negligible detection probability and describes a generic interactive construction based on a public key bit encryption scheme that has certain properties, and gives two examples of encryption schemes with these properties. Expand
Tools for simulating features of composite order bilinear groups in the prime order setting
  • A. Lewko
  • Mathematics, Computer Science
  • 2011
This paper employs the dual pairing vector space approach initiated by Okamoto and Takashima and formulate versatile tools in this framework that can be used to translate composite order schemes for which the prior techniques of Freeman were insufficient. Expand
Deniable cloud storage: sharing files via public-key deniability
This work introduces the concept of deniable cloud storage that guarantees privacy of data even when one's communication and storage can be opened by an adversary and designs the first sender-and-receiver deniable public-key encryption scheme that is both practical and built from standard tools. Expand
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme forExpand
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
This paper presents a cryptosystem whose proof of security makes use of a pairing that is both cancelling and projecting, and shows that a pairing generated in a natural way from the Decision Linear assumption in primeorder groups can be simultaneously cancelled and projecting only with negligible probability. Expand