Bonsai Trees, or How to Delegate a Lattice Basis
- 1 January 2010
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 48 references indexed in Scilit:
- Efficient Lattice (H)IBE in the Standard ModelLecture Notes in Computer Science, 2010
- A Forward-Secure Public-Key Encryption SchemeJournal of Cryptology, 2007
- Chosen‐Ciphertext Security from Identity‐Based EncryptionSIAM Journal on Computing, 2007
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)Lecture Notes in Computer Science, 2006
- Secure Identity Based Encryption Without Random OraclesLecture Notes in Computer Science, 2004
- Efficient Selective-ID Secure Identity-Based Encryption Without Random OraclesLecture Notes in Computer Science, 2004
- Public Key Encryption with Keyword SearchLecture Notes in Computer Science, 2004
- Identity-Based Encryption from the Weil PairingSIAM Journal on Computing, 2003
- Key-Privacy in Public-Key EncryptionLecture Notes in Computer Science, 2001
- Generating Hard Instances of the Short Basis ProblemLecture Notes in Computer Science, 1999