Functional Encryption with Bounded Collusions via Multi-party Computation
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 162-179
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Efficient Fully Homomorphic Encryption from (Standard) LWE2011
- Functional Encryption: Definitions and Challenges2011
- Bounded CCA2-Secure Encryption2007
- COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONScomputational complexity, 2006
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)2006
- An Identity Based Encryption Scheme Based on Quadratic Residues2001
- Identity-Based Encryption from the Weil Pairing2001
- Adaptively secure multi-party computation1996
- The round complexity of secure protocols1990
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988