Statistical concurrent non-malleable zero-knowledge from one-way functions

DOI10.1007/S00145-020-09348-XzbMath1457.94152OpenAlexW3020763047MaRDI QIDQ2188970

Susumu Kiyoshima

Publication date: 15 June 2020

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-020-09348-x

zbMATH Keywords

concurrent non-malleable zero-knowledge CNMZK protocols

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Bit commitment using pseudorandomness
• Minimum disclosure proofs of knowledge
• Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
• How to construct constant-round zero-knowledge proof systems for NP
• Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
• Round-Efficient Black-Box Construction of Composable Multi-Party Computation
• Black-Box Constructions of Composable Protocols without Set-Up
• On Adaptively Secure Protocols
• Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs
• Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
• Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• New and improved constructions of non-malleable cryptographic protocols
• Concurrent Non-Malleable Zero Knowledge Proofs
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• New and Improved Constructions of Nonmalleable Cryptographic Protocols
• The Knowledge Complexity of Interactive Proof Systems
• A Pseudorandom Generator from any One-way Function
• Statistical secrecy and multibit commitments
• Nonmalleable Cryptography
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• Non-malleability amplification
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• Constant-round non-malleable commitments from any one-way function
• Concurrent zero-knowledge
• Concurrent Non-malleable Commitments from Any One-Way Function
• Constant-Round Nonmalleable Commitments from Any One-Way Function
• Statistical Concurrent Non-malleable Zero Knowledge
• Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
• Theory of Cryptography

This page was built for publication: Statistical concurrent non-malleable zero-knowledge from one-way functions