Open Access · CC BY 4.0
Building Hard Problems by Combining Easy Ones, Revisited
IACR Communications in Cryptology · 04.05.2026 · 3 (1)
DOI: 10.62056/a69qgy10k ↗Kurz gefasst
Fachartikel in der Zeitschrift IACR Communications in Cryptology, online erschienen am 04.05.2026. Verfasst von Yael Eisenberg und 4 weiteren Autor:innen. Die Arbeit nennt 14 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
removed due to JATS parsing error
Zitieren
APA
Eisenberg, Y., Havens, C., Korb, A., Merolle, E., & Sahai, A. (2026). Building Hard Problems by Combining Easy Ones, Revisited. IACR Communications in Cryptology, 3(1). https://doi.org/10.62056/a69qgy10k
Vancouver
Eisenberg Y, Havens C, Korb A, Merolle E, Sahai A. Building Hard Problems by Combining Easy Ones, Revisited. IACR Communications in Cryptology. 2026;3(1). doi:10.62056/a69qgy10k
BibTeX
@article{Eisenberg2026,
author = {Eisenberg, Yael and Havens, Christopher and Korb, Alexis and Merolle, Elio and Sahai, Amit},
title = {Building Hard Problems by Combining Easy Ones, Revisited},
journal = {IACR Communications in Cryptology},
year = {2026},
volume = {3},
number = {1},
doi = {10.62056/a69qgy10k}
}
EUVIMED