EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors

Danilo Francati, Daniele Friolo, Giulio Malavolta, Daniele Venturi

Journal of Cryptology · 2024-07 · 37 (3)

DOI: 10.1007/s00145-024-09504-7 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Cryptology, online erschienen am 14.05.2024. Verfasst von Danilo Francati und 3 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 48 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Aarhus Universitet.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We put forward two natural generalizations of predicate encryption (PE), dubbed multi-key and multi-input PE. More in details, our contributions are threefold. Definitions. We formalize security of multi-key PE and multi-input PE following the standard indistinguishability paradigm, and modeling security both against malicious senders (i.e., corruption of encryption keys) and malicious receivers (i.e., collusions). Constructions. We construct adaptively secure multi-key and multi-input PE supporting the conjunction of poly-many arbitrary single-input predicates, assuming the sub-exponential hardness of the learning with errors (LWE) problem. Applications. We show that multi-key and multi-input PE for expressive enough predicates suffices for interesting cryptographic applications, including non-interactive multi-party computation (NI-MPC) and matchmaking encryption (ME). In particular, plugging in our constructions of multi-key and multi-input PE, under the sub-exponential LWE assumption, we obtain the first ME supporting arbitrary policies with unbounded collusions, as well as robust (resp. non-robust) NI-MPC for so-called all-or-nothing functions satisfying a non-trivial notion of reusability and supporting a constant (resp. polynomial) number of parties. Prior to our work, both of these applications required much heavier tools such as indistinguishability obfuscation or compact functional encryption.

Förderung

  • Aarhus Universitet

Zitieren

APA

Francati, D., Friolo, D., Malavolta, G., & Venturi, D. (2024). Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors. Journal of Cryptology, 37(3). https://doi.org/10.1007/s00145-024-09504-7

Vancouver

Francati D, Friolo D, Malavolta G, Venturi D. Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors. Journal of Cryptology. 2024;37(3). doi:10.1007/s00145-024-09504-7

BibTeX
@article{Francati2024,
  author = {Francati, Danilo and Friolo, Daniele and Malavolta, Giulio and Venturi, Daniele},
  title = {Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors},
  journal = {Journal of Cryptology},
  year = {2024},
  volume = {37},
  number = {3},
  doi = {10.1007/s00145-024-09504-7}
}
Kostenlos starten →