Practical constructions and new proof methods for large universe attribute-based encryption
By Yannis Rouselakis, Brent Waters. Conference on Computer and Communications Security, 2013
437 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems
View Paper: https://www.semanticscholar.org/paper/592745ac8339a0330f13baac973c1f998704ad43
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
In Computational Theory and Mathematics
In Information Systems
Citations in the corpus
- Data Security and Privacy Protection for Cloud Storage: A Survey (2020, background): “With the technology from [64], they achieve large universe construction, where the size of attributes is not limited and can be exponentially large, and new attributes can be added into the system.”
- Security and Privacy in Smart Health: Efficient Policy-Hiding Attribute-Based Access Control (2018, background): “[50] proposed both KP-ABE and CP-ABE schemes supporting large universe in groups of prime orders.”