Scholarlink

Cryptographic proofs are a versatile primitive. They are useful in practice not only when used as a standalone tool (for example in verifiable computation), but also when applied on top of other cryptographic functionalities – hash functions, signature schemes, and even proofs themselves – to enhance their security guarantees (for example to provide succinctness). However, when the security of the other primitive is established in the Algebraic Group Model (AGM), the security of the resulting construction does not follow automatically. We introduce a general methodology of provable security for this setting. Our approach guarantees the security of \(\varPi \circ X\) , the composition of a cryptographic proof \(\varPi \) with a functionality X, whenever the security of X is analysed in the AGM. This methodology has general applicability, with immediate relevance to Incrementally Verifiable Computation (IVC), proof aggregation, and aggregate signatures. We obtain:

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On Composing AGM-Secure Functionalities with Cryptographic Proofs

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Matteo Campanelli,
  • Dario Fiore,
  • Mahak Pancholi

摘要

Cryptographic proofs are a versatile primitive. They are useful in practice not only when used as a standalone tool (for example in verifiable computation), but also when applied on top of other cryptographic functionalities – hash functions, signature schemes, and even proofs themselves – to enhance their security guarantees (for example to provide succinctness). However, when the security of the other primitive is established in the Algebraic Group Model (AGM), the security of the resulting construction does not follow automatically. We introduce a general methodology of provable security for this setting. Our approach guarantees the security of \(\varPi \circ X\) , the composition of a cryptographic proof \(\varPi \) with a functionality X, whenever the security of X is analysed in the AGM. This methodology has general applicability, with immediate relevance to Incrementally Verifiable Computation (IVC), proof aggregation, and aggregate signatures. We obtain: