EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Ad Hoc Broadcast, Trace, and Revoke

Ji Luo

IACR Communications in Cryptology · 08.07.2024

DOI: 10.62056/a39qxrxqi ↗

Kurz gefasst

Fachartikel in der Zeitschrift IACR Communications in Cryptology, online erschienen am 08.07.2024. Verfasst von Ji Luo. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 87 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Traitor tracing schemes [Chor–Fiat–Naor, Crypto ’94] help content distributors fight against piracy and are defined with the content distributor as a trusted authority having access to the secret keys of all users. While the traditional model caters well to its original motivation, its centralized nature makes it unsuitable for many scenarios. For usage among mutually untrusted parties, a notion of *ad hoc* traitor tracing (naturally with the capability of broadcast and revocation) is proposed and studied in this work. Such a scheme allows users in the system to generate their own public/secret key pairs, without trusting any other entity. To encrypt, a list of public keys is used to identify the set of recipients, and decryption is possible with a secret key for any of the public keys in the list. In addition, there is a tracing algorithm that given a list of recipients’ public keys and a pirate decoder capable of decrypting ciphertexts encrypted to them, identifies at least one recipient whose secret key must have been used to construct the said decoder. Two constructions are presented. The first is based on functional encryption for circuits (conceptually, obfuscation) and has constant-size ciphertext, yet its decryption time is linear in the number of recipients. The second is a generic transformation that reduces decryption time at the cost of increased ciphertext size. A matching lower bound on the trade-off between ciphertext size and decryption time is shown, indicating that the two constructions achieve all possible optimal trade-offs, i.e., they fully demonstrate the Pareto front of efficiency. The lower bound also applies to broadcast encryption (hence all mildly expressive attribute-based encryption schemes) and is of independent interest.

Zitieren

APA

Luo, J. (2024). Ad Hoc Broadcast, Trace, and Revoke. IACR Communications in Cryptology. https://doi.org/10.62056/a39qxrxqi

Vancouver

Luo J. Ad Hoc Broadcast, Trace, and Revoke. IACR Communications in Cryptology. 2024. doi:10.62056/a39qxrxqi

BibTeX
@article{Luo2024,
  author = {Luo, Ji},
  title = {Ad Hoc Broadcast, Trace, and Revoke},
  journal = {IACR Communications in Cryptology},
  year = {2024},
  doi = {10.62056/a39qxrxqi}
}
Kostenlos starten →