Shrinking the keys of discrete-log-type lossy trapdoor functions
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Generic constructions for chosen-ciphertext secure attribute based encryption
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Expressive key-policy attribute-based encryption with constant-size ciphertexts
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
ProvSec'11 Proceedings of the 5th international conference on Provable security
Securing electronic medical records using attribute-based encryption on mobile devices
Proceedings of the 1st ACM workshop on Security and privacy in smartphones and mobile devices
Poster: attribute based broadcast encryption with permanent revocation
Proceedings of the 18th ACM conference on Computer and communications security
Attribute-based encryption schemes with constant-size ciphertexts
Theoretical Computer Science
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Towards attribute revocation in key-policy attribute based encryption
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Threshold ciphertext policy attribute-based encryption with constant size ciphertexts
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Fully private revocable predicate encryption
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Functional encryption: a new vision for public-key cryptography
Communications of the ACM
Fully secure doubly-spatial encryption under simple assumptions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
A general construction for multi-authority attribute-based encryption
AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
Multi-channel broadcast encryption
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
International Journal of Security and Networks
A scalable encryption scheme for multi-privileged group communications
The Journal of Supercomputing
| Hi-index | 0.02 |
In this work, we design a method for creating public key broadcast encryption systems. Our main technical innovation is based on a new "two equation" technique for revoking users. This technique results in two key contributions: First, our new scheme has ciphertext size overhead $O(r)$, where $r$ is the number of revoked users, and the size of public and private keys is only a \emph{constant} number of group elements from an elliptic-curve group of prime order. In addition, the public key allows us to encrypt to an unbounded number of users. Our system is the first to achieve such parameters. We give two versions of our scheme: a simpler version which we prove to be selectively secure in the standard model under a new, but non-interactive assumption, and another version that employs the new dual system encryption technique of Waters to obtain adaptive security under the d-BDH and decisional Linear assumptions. Second, we show that our techniques can be used to realize Attribute-Based Encryption (ABE) systems with non-monotonic access formulas, where our key storage is significantly more efficient than previous solutions. This result is also proven selectively secure in the standard model under our new non-interactive assumption.