• Corpus ID: 238744340

3LSAA: A Secure And Privacy-preserving Zero-knowledge-based Data-sharing Approach Under An Untrusted Environment

  title={3LSAA: A Secure And Privacy-preserving Zero-knowledge-based Data-sharing Approach Under An Untrusted Environment},
  author={Wei-Yi Kuo and Ren-Song Tsay},
Logos Advanced System Lab, Dept. of Computer Science, National Tsing-Hua University, Taiwan ABSTRACT As data collection and analysis become critical functions for many cloud applications, proper data sharing with approved parties is required. However, the traditional data sharing scheme through centralized data escrow servers may sacrifice owners' privacy and is weak in security. Mainly, the servers physically own all data while the original data owners have only virtual ownership and lose… 

Figures from this paper


Verifiable searchable encryption with aggregate keys for data sharing system
This paper proposes a scheme named “verifiable searchable encryption with aggregate keys”, which a data owner need only distribute a single aggregate key to other users to selectively share both search and verification privileges over his/her document sets.
Ciphertext-Policy Attribute-Based Encryption
A system for realizing complex access control on encrypted data that is conceptually closer to traditional access control methods such as role-based access control (RBAC) and secure against collusion attacks is presented.
CP-ABSE: A Ciphertext-Policy Attribute-Based Searchable Encryption Scheme
This paper proposes an attribute-based searchable encryption scheme that encrypts an index keyword under a specified access policy, if and only if, a data user’s attributes satisfy the access policy and the data user can perform search over the encrypted index keyword.
A query privacy-enhanced and secure search scheme over encrypted data in cloud computing
This work proposes a privacy-enhanced search scheme by allowing the data user to generate random query trapdoor every time, and uses Bloom filter and bilinear pairing operation to construct secure index for each data file, which enables the cloud to perform search without obtaining any useful information.
Anonymous attribute-based proxy re-encryption for access control in cloud computing
This paper formalizes the notion of anonymous ciphertext-policy attribute-based proxy re-encryption anonymous CP-ABPRE and proposes a novel technique called match-then-re-encrypt, in which a matching phase is additionally introduced before the re- Encryption phase.
Protecting your right: Attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud
This paper presents the first attribute-based keyword search scheme with efficient user revocation (ABKS-UR) that enables scalable fine-grained (i.e. file-level) search authorization and formalizes the security definition and proves the proposed AB KS-UR scheme selectively secure against chosen-keyword attack.
Key-Aggregate Searchable Encryption ( KASE ) for Group Data Sharing via Cloud Storage
The ability of specifically offering encoded info rmation to various clients through open distributed storage might enormously ease security worries over coincidental information leaks in the cloud.
Dynamic User Revocation and Key Refreshing for Attribute-Based Encryption in Cloud Storage
  • Zhiqian Xu, K. Martin
  • Computer Science
    2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications
  • 2012
A dynamic user revocation and key refreshing model for CP-ABE schemes to refresh the system keys or remove the access from a user without issuing new keys to other users or re-encrypting existing ciphertexts is proposed.
A Study of Attribute-based Proxy Re-encryption Scheme in Cloud Environments
This paper surveys two various access policy attribute-based proxy re-encryption schemes and analyzes these schemes and lists the comparisons of them by some criteria.
DMU-ABSE: Dynamic Multi-user Attribute-Based Searchable Encryption with File Deletion and User Revocation
This paper manipulates an attribute-based encryption to achieve fine-grained search privilege control and hidden policy in multi-user setting while searching time of the proposed scheme is constant (O(1); results shows that the scheme is efficient.