Filters








954 Hits in 4.8 sec

Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions [chapter]

Gene Itkis, Emily Shen, Mayank Varia, David Wilson, Arkady Yerukhimovich
2017 Lecture Notes in Computer Science  
We also obtain bounded-collusion symmetric-key ABE (which requires the secret key for encryption) by replacing the public-key encryption with symmetric-key encryption, which can be built from the minimal  ...  Attribute-based encryption (ABE) enables encryption of messages under access policies so that only users with attributes satisfying the policy can decrypt the ciphertext.  ...  Basic BC-ABE Construction We now present our basic bounded-collusion construction that builds a q-query secure attribute-based encryption scheme from a 1-query secure attribute-based encryption scheme.  ... 
doi:10.1007/978-3-662-54388-7_3 fatcat:hlnp5wxgqjg4levecaogtlfo64

On efficient ciphertext-policy attribute based encryption and broadcast encryption

Zhibin Zhou, Dijiang Huang
2010 Proceedings of the 17th ACM conference on Computer and communications security - CCS '10  
Based on CCP-ABE, we further proposed an Attribute Based Broadcast Encryption (ABBE) scheme.  ...  Ciphertext Policy Attribute Based Encryption (CP-ABE) enforces an expressive data access policy, which consists of a number of attributes connected by logical gates.  ...  Based on CCP-ABE, we further proposed an Attribute Based Broadcast Encryption (ABBE) scheme that attains information theoretical minimal storage overhead.  ... 
doi:10.1145/1866307.1866420 dblp:conf/ccs/ZhouH10 fatcat:wrjs6jlrjjcipfv323cc26xmdi

New Perspectives on Lattice-Based Functional Encryption for Analysis on Encrypted Data

Zongchen Sun, Leyou Zhang
2017 ICIC Express Letters  
In this work, we discuss how to construct a succinct lattice-based functional encryption scheme by linear FE (short as LinFE) for inner products and show some new perspectives on the applications of it  ...  A solution to this problem is functional encryption (FE) that enables direct computation on encrypted data. This novel paradigm breaks all-or-nothing access model.  ...  In recent works [7, 11] , the problem of lattice-based FE for bounded collusions has been resolved without strong assumptions, such as indistinguishability obfuscation, and multilinear map.  ... 
doi:10.24507/icicel.11.04.871 fatcat:eo3bkrh5pnf3jnamkq3635xx7y

Outsourcing high-dimensional healthcare data to cloud with personalized privacy preservation

Wei Wang, Lei Chen, Qian Zhang
2015 Computer Networks  
We derive provable privacy guarantees and bounded data distortion to validate the proposed protocols.  ...  However, previous solutions have focused on cryptographic techniques which introduce significant cost when applied to healthcare data with high-dimensional sensitive attributes.  ...  LKC-120 privacy makes an assumption that the background knowledge of adversaries is bounded by L values of QI attributes to limit the power of adversaries. Wong et al.  ... 
doi:10.1016/j.comnet.2015.06.014 fatcat:cw3l3xr2nzfdxihiujo33wrlfi

CESCR: CP-ABE for efficient and secure sharing of data in collaborative ehealth with revocation and no dummy attribute

Kennedy Edemacu, Beakcheol Jang, Jong Wook Kim, Pandi Vijayakumar
2021 PLoS ONE  
Ciphertext-policy attribute-based encryption (CP-ABE) has shown promising potential in providing data security and privacy in cloud-based systems.  ...  outsources the computationally demanding attribute operations of both encryption and decryption processes without requiring a dummy attribute.  ...  However, unlike in previous works, to prevent collusion attacks, the attribute group keys are efficiently bound to the user identities in this work.  ... 
doi:10.1371/journal.pone.0250992 pmid:33974672 fatcat:uc32mh5burc5vd3vflmd3w2qqi

e-Health Cloud: Privacy Concerns and Mitigation Strategies [chapter]

Assad Abbas, Samee U. Khan
2015 Medical Data Privacy Handbook  
using policy based authorizations.  ...  The PHRs are the health records that are managed by the patients themselves and comprise of the information instigated from diverse sources.  ...  A key strength of the approach is that despite of using the attribute based access structure, the computational and communication overheads are minimized.  ... 
doi:10.1007/978-3-319-23633-9_15 fatcat:lz766kkhs5bqdeyo5r46n26zci

Traceable ciphertext-policy attribute-based encryption scheme with attribute level user revocation for cloud storage

Shangping Wang, Keke Guo, Yaling Zhang, Hua Wang
2018 PLoS ONE  
PLoS ONE 13(9): e0203225. https://doi.org/10.ABE has two main categories: ciphertext-policy attribute-based encryption (CP-ABE) [2] and key-policy attribute-based encryption (KP-ABE) [3] .  ...  In a ciphertext-policy attribute-based encryption (CP-ABE) scheme, a user may have multiple attributes, and each attribute may be shared simultaneously by many users.  ...  Inspired by [25] and [29] , we provide a traceable ciphertext-policy attribute-based encryption scheme with attribute-level user revocation for cloud storage (TUR-C-PABE).  ... 
doi:10.1371/journal.pone.0203225 pmid:30212473 pmcid:PMC6136790 fatcat:ch3n4hexrrc7loh2t6rjc3acgi

Ciphertext-Policy Attribute-Based Encryption

John Bethencourt, Amit Sahai, Brent Waters
2007 2007 IEEE Symposium on Security and Privacy (SP '07)  
Previous Attribute-Based Encryption systems used attributes to describe the encrypted data and built policies into user's keys; while in our system attributes are used to describe a user's credentials,  ...  In this paper we present a system for realizing complex access control on encrypted data that we call Ciphertext-Policy Attribute-Based Encryption.  ...  Collusion Resistance and Attribute-Based Encryption The defining property of Attribute-Based Encryption systems are their resistance to collusion attacks.  ... 
doi:10.1109/sp.2007.11 dblp:conf/sp/BethencourtSW07 fatcat:2sxuuhtj5fgzzafnc5ggpdifda

On replacing cryptographic keys in hierarchical key management systems

Anne V.D.M. Kayem, Selim G. Akl, Patrick Martin
2008 Journal of Computer Security  
Therefore, in comparison to quasi-static approaches, the adaptive CKM scheme minimizes the long-term cost of key updates.  ...  Access to data is granted only if a user holds the "correct" key, or can derive the required key from the one in their possession.  ...  In order to remove the collusion liable keys we use a collusion removal algorithm that is based on the principle of computing an independent set from the vertices in a graph.  ... 
doi:10.3233/jcs-2008-16303 fatcat:3usm2iiw5bevngv6sdhlem5tyq

Hierarchical Functional Encryption

Zvika Brakerski, Nishanth Chandran, Vipul Goyal, Aayush Jain, Amit Sahai, Gil Segev, Marc Herbstritt
2017 Innovations in Theoretical Computer Science  
In addition, even when starting with schemes that are secure against a bounded number of collusions (which are known to exist under rather minimal assumptions such as the existence of public-key encryption  ...  and shallow pseudorandom generators), we can support hierarchical structures of bounded depth and width. * In this extended abstract we present results from [BS15b] and [CGJ + 15].  ...  under minimal assumptions.  ... 
doi:10.4230/lipics.itcs.2017.8 dblp:conf/innovations/BrakerskiCGJSS17 fatcat:y6i64ftilzda5ic6wwqyocclae

Functional Encryption with Bounded Collusions via Multi-party Computation [chapter]

Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
2012 Lecture Notes in Computer Science  
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits.  ...  For certain special cases such as predicate encryption schemes with public index, the construction requires only semantically secure encryption schemes, which is clearly the minimal necessary assumption  ...  encryption schemes, which is clearly the minimal necessary assumption.  ... 
doi:10.1007/978-3-642-32009-5_11 fatcat:yxpdhyl4dnfizcb7p4pxriz27a

Privacy Preserving Data Mining [chapter]

Xinjing Ge, Jianming Zhu
2011 New Fundamental Technologies in Data Mining  
Therefore the non-collusion (k = 1) assumption of the classical secure multi-party sum is sub-optimal.  ...  Complexity Analysis:The bit-wise communication cost of this protocol is upper bounded by 2[ ( 1 ) ] nN n α −+ , where α is the number of bits for each encrypted element.  ... 
doi:10.5772/13364 fatcat:cbzoogvfurfgdecpileutyhh4q

Privacy-preserving Data Mining [chapter]

Yong Yin, Ikou Kaku, Jiafu Tang, JianMing Zhu
2011 Data Mining  
Therefore the non-collusion (k = 1) assumption of the classical secure multi-party sum is sub-optimal.  ...  Complexity Analysis:The bit-wise communication cost of this protocol is upper bounded by 2[ ( 1 ) ] nN n α −+ , where α is the number of bits for each encrypted element.  ... 
doi:10.1007/978-1-84996-338-1_6 fatcat:ejckqma32jgnlnxfmx56bhtpyy

Collusion-Free Policy-Based Encryption [chapter]

Walid Bagga, Refik Molva
2006 Lecture Notes in Computer Science  
In this paper, we present a collusion-free policy-based encryption primitive, called policy-based public-key encryption.  ...  An inherent property of policy-based encryption is that in addition to the recipient an encrypted message is intended for, any collusion of credential issuers or end users who are able to collect a qualified  ...  All the presented schemes are based on the Boneh-Franklin identity-based encryption primitive described in [5] , from which they inherit the collusion property.  ... 
doi:10.1007/11836810_17 fatcat:3ia7vslmk5dfbkdisxravp76ma

Fed-DFE: A Decentralized Function Encryption-Based Privacy-Preserving Scheme for Federated Learning

Shahid Habib, Ghaffer Iqbal Kiani, Muhammad Fasih Uddin Butt, Syed Muzahir Abbas, Abdulah Jeza Aljohani, Soon Xin Ng
2022 Computers Materials & Continua  
It replaces the TTP in traditional function encryption with an interactive key generation algorithm, avoiding the problem of collusion.  ...  The function encryption in federal learning still has the following problems: a) Traditional function encryption usually requires a trust third party (TTP) to assign the keys.  ...  Tail bound.  ... 
doi:10.32604/cmc.2022.022290 fatcat:bfzgrjswdbgn7hbkzoqmptyxja
« Previous Showing results 1 — 15 out of 954 results