Explicit Transformations from Edge-Depth-Robust to Node-Depth-Robust Graphs with Improved Concrete Efficiency
Jeremiah Blocki, Purdue University West Lafayette
·
2026-06-10
·
via Cryptology ePrint Archive
Depth-robust directed acyclic graphs (DAGs) are an important combinatorial primitive in cryptography, with ap…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。