New Lattice Two-Stage Sampling Technique and Its Applications to Functional Encryption – Stronger Security and Smaller Ciphertexts

9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work proposes a new lattice two-stage sampling technique, generalizing the prior two-stage sampling method of Gentry, Peikert, and Vaikuntanathan (STOC ’08). By using our new technique as a key building block, we can significantly improve security and efficiency of the current state of the arts of simulation-based functional encryption. Particularly, our functional encryption achieves (Q, poly) simulation-based semi-adaptive security that allows arbitrary pre- and post-challenge key queries, and has succinct ciphertexts with only an additive O(Q) overhead. Additionally, our two-stage sampling technique can derive new feasibilities of indistinguishability-based adaptively-secure IB - FE for inner products and semi-adaptively-secure AB - FE for inner products, breaking several technical limitations of the recent work by Abdalla, Catalano, Gay, and Ursu (Asiacrypt ’20).

Cite

CITATION STYLE

APA

Lai, Q., Liu, F. H., & Wang, Z. (2021). New Lattice Two-Stage Sampling Technique and Its Applications to Functional Encryption – Stronger Security and Smaller Ciphertexts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12696 LNCS, pp. 498–527). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-77870-5_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free