Identity-Based (Lossy) Trapdoor Functions and Applications
- 1 January 2012
- 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 49 references indexed in Scilit:
- Generating Shorter Bases for Hard Random LatticesTheory of Computing Systems, 2010
- Efficient Lattice (H)IBE in the Standard ModelLecture Notes in Computer Science, 2010
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBELecture Notes in Computer Science, 2010
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE SchemeLecture Notes in Computer Science, 2009
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective OpeningLecture Notes in Computer Science, 2009
- Hedged Public-Key Encryption: How to Protect against Bad RandomnessLecture Notes in Computer Science, 2009
- Security Proofs for Identity-Based Identification and Signature SchemesJournal of Cryptology, 2008
- Deterministic and Efficiently Searchable EncryptionPublished by Springer Science and Business Media LLC ,2007
- Generating Hard Instances of the Short Basis ProblemLecture Notes in Computer Science, 1999
- Many-to-one trapdoor functions and their relation to public-key cryptosystemsPublished by Springer Science and Business Media LLC ,1998