Bonsai Trees, or How to Delegate a Lattice Basis
- 6 September 2011
- journal article
- research article
- Published by Springer Science and Business Media LLC in Journal of Cryptology
- Vol. 25 (4), 601-639
- https://doi.org/10.1007/s00145-011-9105-2
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- Some Recent Progress in Lattice-Based CryptographyLecture Notes in Computer Science, 2009
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and ExtensionsJournal of Cryptology, 2007
- Lattices that admit logarithmic worst-case to average-case connection factorsPublished by Association for Computing Machinery (ACM) ,2007
- A Forward-Secure Public-Key Encryption SchemeJournal of Cryptology, 2007
- Chosen‐Ciphertext Security from Identity‐Based EncryptionSIAM Journal on Computing, 2007
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- Identity-Based Encryption from the Weil PairingSIAM Journal on Computing, 2003
- A linear space algorithm for computing the hermite normal formPublished by Association for Computing Machinery (ACM) ,2001
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988