Secure threshold multi authority attribute based encryption without a central authority
By Huang Lin, Zhenfu Cao, Xiaohui Liang, Jun Shao. Information Sciences, 2008
324 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/23c440685521a53d8db55c125a083cff9969f5e3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Brent Waters
- Allison Bishop
- Kui Ren
- Kan Yang
- Xiaohua Jia
- Sherman S. M. Chow
- Melissa Chase
- Amit Sahai
In Computational Theory and Mathematics
- Allison Bishop
- Brent Waters
- Kui Ren
- Kan Yang
- Xiaohua Jia
- Sherman S. M. Chow
- Melissa Chase
- Atsuko Miyaji
Citations in the corpus
- A ciphertext-policy attribute-based encryption scheme with constant ciphertext length (2009, background): “There are some extended ABE schemes such as ABE schemes with the multi-authority [14, 22], an attribute-based broadcast encryption scheme [23], and a CP-ABE scheme with recipient anonymity [25].”
- DAC-MACS: Effective Data Access Control for Multiauthority Cloud Storage Systems (2013, methodology): “…fi rst proposes an extensive data access control scheme (EDAC-MACS), and then give the security Some cryptographic methods are proposed for the multiau-thority ABE problem [7]–[10], [26], [27], where there are multiple authorities coexist and users may have attributes from multiple authorities.”
- Persona: an online social network with user-defined privacy (2009, background): “Multi-authority ABE [7, 23] removes the need for transitive key translations but requires each user to have a globally-unique identifier and the attribute set to be partitioned amongst the users.”
- Decentralizing Attribute-Based Encryption (2011, background): “[40] give a threshold based scheme that is also somewhat decentralized.”
- Improving privacy and security in multi-authority attribute-based encryption (2009, background): “’s scheme [10], since our scheme is secure against polynomially-many users, we sug-”