Lattice Mixing and Vanishing Trapdoors A Framework for Fully Secure Short Signatures and more
暂无分享,去创建一个
[1] Oded Regev,et al. Lattice-Based Cryptography , 2006, CRYPTO.
[2] Aggelos Kiayias,et al. Advances in Cryptology - EUROCRYPT 2004 , 2004 .
[3] Shafi Goldwasser,et al. Complexity of lattice problems , 2002 .
[4] Daniele Micciancio. Lattice-Based Cryptography , 2011, Encyclopedia of Cryptography and Security.
[5] Chris Peikert,et al. Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography) , 2009, IACR Cryptol. ePrint Arch..
[6] Xavier Boyen,et al. Identity-Based Encryption from Lattices in the Standard Model , 2009 .
[7] László Lovász,et al. Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.
[8] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[9] Miklós Ajtai,et al. Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.
[10] Nicolas Gama,et al. Predicting Lattice Reduction , 2008, EUROCRYPT.
[11] Brent Waters,et al. Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.
[12] Nigel P. Smart,et al. Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings , 2008, EUROCRYPT.
[13] Shafi Goldwasser,et al. Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.
[14] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[15] Ran Canetti,et al. A Forward-Secure Public-Key Encryption Scheme , 2003, Journal of Cryptology.
[16] Chris Peikert,et al. Generating Shorter Bases for Hard Random Lattices , 2009, Theory of Computing Systems.
[17] Dan Boneh,et al. Efficient Lattice (H)IBE in the Standard Model , 2010, EUROCRYPT.
[18] Dan Boneh,et al. Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE , 2010, CRYPTO.
[19] Ronald Cramer,et al. Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings , 2005, EUROCRYPT.
[20] Dan Boneh,et al. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..
[21] Daniele Micciancio,et al. Worst-case to average-case reductions based on Gaussian measures , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[22] Chris Peikert,et al. Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices , 2006, TCC.
[23] Parampalli Udaya,et al. E cient Identity-based Signcryption without Random Oracles , 2012, AISC.
[24] Brent Waters,et al. Short and Stateless Signatures from the RSA Assumption , 2009, CRYPTO.
[25] David Cash,et al. How to Delegate a Lattice Basis , 2009, IACR Cryptol. ePrint Arch..
[26] Dorit Aharonov,et al. Lattice problems in NP ∩ coNP , 2005, JACM.
[27] Miklós Ajtai,et al. Generating Hard Instances of the Short Basis Problem , 1999, ICALP.
[28] Craig Gentry,et al. Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..