Computational soundness for interactive primitives

DOI10.1007/978-3-319-24174-6_7MaRDI QIDQ5097043zbMATH OpenOpenAlexFDO

Authors Michael Backes, Esfandiar Mohammadi, Tim Ruffing

Publication date 19 August 2022

Published in Computer Security -- ESORICS 2015 (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 2.5 Generic

Full work available at URL https://doi.org/10.1007/978-3-319-24174-6_7

Mathematics Subject Classification ID

Computer security (68M25) Cryptography (94A60)

Recommendations

• Computational soundness of symbolic zero-knowledge proofs: weaker assumptions and mechanized verification
• Computational soundness of indistinguishability properties without computable parsing
• Computational soundness of symbolic analysis for protocols using hash functions
• Towards unconditional soundness: computationally complete symbolic attacker
• Computationally sound abstraction and verification of secure multi-party computations

Cited in

(1)

• Computational soundness of symbolic zero-knowledge proofs: weaker assumptions and mechanized verification

This page was built for publication: Computational soundness for interactive primitives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097043)