New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
Top Cited Papers
- 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 32 references indexed in Scilit:
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based EncryptionLecture Notes in Computer Science, 2012
- Identity-Based Encryption Secure against Selective Opening AttackLecture Notes in Computer Science, 2011
- Efficient Lattice (H)IBE in the Standard ModelLecture Notes in Computer Science, 2010
- Bonsai Trees, or How to Delegate a Lattice BasisLecture Notes in Computer Science, 2010
- Hierarchical Identity Based Encryption with Constant Size CiphertextLecture Notes in Computer Science, 2005
- Evaluating 2-DNF Formulas on CiphertextsLecture Notes in Computer Science, 2005
- 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
- A Forward-Secure Public-Key Encryption SchemeLecture Notes in Computer Science, 2003
- Identity-Based Encryption from the Weil PairingLecture Notes in Computer Science, 2001