Name
Abstract | ||
|---|---|---|
We extend the reach of functional encryption schemes that are provably secure under simple assumptions against unbounded collusion to include function-hiding inner product schemes. Our scheme is a private key functional encryption scheme, where ciphertexts correspond to vectors $$\\vec {x}$$, secret keys correspond to vectors $$\\vec {y}$$, and a decryptor learns $$\\langle \\vec {x}, \\vec {y} \\rangle $$. Our scheme employs asymmetric bilinear maps and relies only on the SXDH assumption to satisfy a natural indistinguishability-based security notion where arbitrarily many key and ciphertext vectors can be simultaneously changed as long as the key-ciphertext dot product relationships are all preserved. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-48797-6_20 | IACR Cryptology ePrint Archive |
Field | DocType | Volume |
Discrete mathematics,Computer science,Theoretical computer science,Encryption,Functional encryption,Ciphertext,Dot product,Public-key cryptography,Collusion,Bilinear interpolation | Journal | 2015 |
ISSN | Citations | PageRank |
0302-9743 | 25 | 0.93 |
References | Authors | |
26 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Allison Bishop | 1 | 35 | 1.71 |
| Abhishek Jain 0002 | 2 | 73 | 3.14 |
| Lucas Kowalczyk | 3 | 44 | 4.97 |