(Deterministic) Hierarchical Identity-based Encryption from Learning with Rounding over Small Modulus
暂无分享,去创建一个
Dingding Jia | Xianhui Lu | Bao Li | Haiyang Xue | Yamin Liu | Fuyang Fang
[1] Chris Peikert,et al. Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..
[2] Brent Waters,et al. Lossy trapdoor functions and their applications , 2008, SIAM J. Comput..
[3] Rui Zhang,et al. Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting , 2012, SCN.
[4] Javier Herranz,et al. Identity-Based Lossy Trapdoor Functions: New Definitions, Hierarchical Extensions, and Implications , 2014, Public Key Cryptography.
[5] Abhishek Banerjee,et al. Pseudorandom Functions and Lattices , 2012, EUROCRYPT.
[6] Silas Richelson,et al. On the Hardness of Learning with Rounding over Small Modulus , 2016, TCC.
[7] Craig Gentry,et al. Hierarchical ID-Based Cryptography , 2002, ASIACRYPT.
[8] Dan Boneh,et al. Efficient Lattice (H)IBE in the Standard Model , 2010, EUROCRYPT.
[9] Brent Waters,et al. Identity-Based (Lossy) Trapdoor Functions and Applications , 2012, EUROCRYPT.
[10] Ben Lynn,et al. Toward Hierarchical Identity-Based Encryption , 2002, EUROCRYPT.
[11] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[12] Dan Boneh,et al. Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE , 2010, CRYPTO.
[13] David Cash,et al. Bonsai Trees, or How to Delegate a Lattice Basis , 2010, Journal of Cryptology.