Efficient Lattice (H)IBE in the Standard Model

By Shweta Agrawal, Dan Boneh, Xavier Boyen. International Conference on the Theory and Application of Cryptographic Techniques, 2010

1,020 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/267d8ebb2241e95641ea15b1a94e3e85d0296e37

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

Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE (2016, background): “Constructions based on LWE have led to a large variety of public-key cryptosystems [38, 52, 31, 18, 3, 2, 17].”
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE (2010, methodology): “Table 1 shows that the construction is only competitive with existing HIBEs [CHKP10, ABB10 ] in applications where k � the construction is not competitive due to the k 2 term in the ciphertext length (compared to k� in [CHKP10] and � in [ABB10]).”
A Toolkit for Ring-LWE Cryptography (2013, methodology): “Such a lemma is needed for porting many applications of standard SIS and LWE to the ring setting, including SIS-based signature schemes [19, 10, 7, 28], the “primal” [31] and “dual” [19] LWE cryptosystems, chosen ciphertext-secure encryption schemes [29, 28], and (hierarchical) identity-based encryp”
Identity-Based Encryption with Outsourced Revocation in Cloud Computing (2015, background): “Recently, there have been multiple lattice-based constructions for IBE systems [20][21][22].”
Bonsai Trees, or How to Delegate a Lattice Basis (2010, methodology): “Agrawal, Boneh, and Boyen [ABB10] improved the efﬁciency of our (H)IBE schemes (under a somewhat stronger LWE assumption), and Boyen [Boy10] used similar techniques to obtain shorter signatures (under a stronger SIS assumption).”
On Ideal Lattices and Learning with Errors over Rings (2010, neutral): “…[Reg05, PVW08, LP11] and chosen-ciphertext [PW08, Pei09, MP12] attacks, oblivious transfer [PVW08], identity-based encryption [GPV08, CHKP10, ABB10a, ABB10b], various forms of leakage-resilient cryptography (e.g., [AGV09, ACPS09, GKPV10]), fully homomorphic encryption [BV11, BGV12]…”
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].”
Unbounded HIBE and Attribute-Based Encryption (2011, methodology): “Fully secure solutions in the standard model were later provided by Boneh and Boyen [10] and Waters [44].”
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (2012, methodology): “In recent years lattice-based cryptography has also been shown to be extremely versatile, leading to a large number of theoretical applications ranging from (hierarchical) identity-based encryption [20, 13, 1, 2], to fully homomorphic encryption schemes [17, 16, 45, 12, 11, 18, 10], and much more (e”
Efficient Fully Homomorphic Encryption from (Standard) LWE (2011, background): “, [33], [19], [4], [5], [10], [1] and many others).”
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (2011, background): “These include CPA and CCA secure encryption schemes, identity-based encryption schemes, digital signatures, etc (see [32, 29, 11, 5, 1] among others, and the surveys [25, 33]).”
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012, background): “Subsequent constructions of IBE and HIBE can be found in [11] [6] [7] [8] [15] [16] [24] [1] [12] [26].”
Witness encryption and its applications (2013, neutral): “(LWE) parameters [6, 1], or RSA modulus [8].”