Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
By Shweta Agrawal, Dan Boneh, Xavier Boyen. Annual International Cryptology Conference, 2010
424 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/b4928322c47871134395e26c31cec1772f8c5e0e
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
- Dan Boneh
- Vinod Vaikuntanathan
- Amit Sahai
- Xavier Boyen
- Craig Gentry
- Shweta Agrawal
In Computational Theory and Mathematics
- Brent Waters
- Allison Bishop
- Dan Boneh
- Xavier Boyen
- Vinod Vaikuntanathan
- Shweta Agrawal
- Craig Gentry
- Amit Sahai
Citations in the corpus
- Attribute-based encryption for circuits (2013, methodology): “In this section, we present an instantiation of TOR from LWE, building upon ideas in [1, 2, 16, 23].”
- Efficient Lattice (H)IBE in the Standard Model (2010, background): “We note that a recent result of [2] uses a different basis delegation mechanism to construct an improved HIBE where the lattice dimension is fixed for the entire hierarchy.”
- Unbounded HIBE and Attribute-Based Encryption (2011, background): “Fully secure solutions in the standard model were later provided by Boneh and Boyen [10] and Waters [44].”