A tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency

Guilhem Castagnos, Fabien Laguillaumie, Ida Tucker

Open source

DOI
10.1016/j.tcs.2022.02.014
Published
2022-05
Container
Theoretical Computer Science
Publisher
Elsevier BV
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1016/j.tcs.2022.02.014,
  title = {A tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency},
  author = {Guilhem Castagnos and Fabien Laguillaumie and Ida Tucker},
  year = {2022},
  journal = {Theoretical Computer Science},
  doi = {10.1016/j.tcs.2022.02.014},
  url = {https://doi.org/10.1016/j.tcs.2022.02.014}
}

RIS

TY  - JOUR
TI  - A tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency
AU  - Guilhem Castagnos
AU  - Fabien Laguillaumie
AU  - Ida Tucker
PY  - 2022
JO  - Theoretical Computer Science
DO  - 10.1016/j.tcs.2022.02.014
UR  - https://doi.org/10.1016/j.tcs.2022.02.014
ER  - 

APA

Castagnos, G., Laguillaumie, F., & Tucker, I. (2022). A tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency. Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2022.02.014

Source records