Four-round statistical non-malleable zero-knowledge

DOI10.1007/978-3-032-12290-2_5MaRDI QIDQ7233229zbMATH OpenFDO

Authors Susumu Kiyoshima

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12290-2_5

zbMATH Keywords

collision-resistant hash functioninjective one-way function

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A new approach to efficient non-malleable zero-knowledge
• An Algebraic Approach to Nonmalleability
• Black-box (and fast) non-malleable zero knowledge
• Concurrent Non-malleable Commitments from Any One-Way Function
• Concurrent Nonmalleable Commitments
• Concurrent non-malleable zero knowledge proofs
• Concurrent non-malleable zero knowledge with adaptive inputs
• Concurrently secure computation in constant rounds
• Constant round non-malleable protocols using one way functions
• Constant-Round Nonmalleable Commitments from Any One-Way Function
• Constant-round concurrent zero knowledge from P-certificates
• Constant-round concurrent zero-knowledge from indistinguishability obfuscation
• Constant-round non-malleable commitments from any one-way function
• Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Four-round black-box non-malleable schemes from one-way permutations
• Four-round concurrent non-malleable commitments from one-way functions
• Improved OR-composition of sigma-protocols
• Improved black-box constructions of composable secure computation
• Limits of provable security from standard assumptions
• Long-term security and universal composability
• New and Improved Constructions of Nonmalleable Cryptographic Protocols
• Non-malleable commitments using Goldreich-Levin list decoding
• Non-malleable zero knowledge: black-box constructions and definitional relationships
• Non-uniformly sound certificates with applications to concurrent zero-knowledge
• Nonmalleable Cryptography
• Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP
• On adaptively secure protocols
• On the Composition of Zero-Knowledge Proof Systems
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures
• Online/offline OR composition of sigma protocols
• Practical and provably-secure commitment schemes from collision-free hashing
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Statistical concurrent non-malleable zero knowledge
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Textbook non-malleable commitments

This page was built for publication: Four-round statistical non-malleable zero-knowledge

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