Abstract
We generalize known searchable encryption schemes [8] to N-party contexts using constructions based on multilinear maps. The span of the maps used is also expanded, as the schemes we propose can make use of both prime order and composite order group contexts.
Cite
CITATION STYLE
APA
Talif, V. M. (2019). Implementing searchable encryption schemes over multilinear maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11359 LNCS, pp. 458–476). Springer Verlag. https://doi.org/10.1007/978-3-030-12942-2_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free