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

DOI10.1007/S00145-020-09348-XMaRDI QIDQ2188970zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Concurrent non-malleable zero knowledge proofs
• Statistical concurrent non-malleable zero knowledge
• Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
• Concurrent non-malleable zero knowledge with adaptive inputs

Cites work

• A Pseudorandom Generator from any One-way Function
• Adaptive hardness and composable security in the plain model from standard assumptions
• Bit commitment using pseudorandomness
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Black-box constructions of composable protocols without set-up
• Concurrent Non-malleable Commitments from Any One-Way Function
• Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
• Concurrent non-malleable zero knowledge proofs
• Concurrent non-malleable zero knowledge with adaptive inputs
• Concurrent zero-knowledge
• Constant-Round Nonmalleable Commitments from Any One-Way Function
• Constant-round black-box construction of composable multi-party computation protocol
• 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
• How to construct constant-round zero-knowledge proof systems for NP
• Minimum disclosure proofs of knowledge
• New and Improved Constructions of Nonmalleable Cryptographic Protocols
• New and improved constructions of non-malleable cryptographic protocols
• Non-malleability amplification
• Nonmalleable Cryptography
• On adaptively secure protocols
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• Round-efficient black-box construction of composable multi-party computation
• Statistical concurrent non-malleable zero knowledge
• Statistical secrecy and multibit commitments
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography

Cited in

(11)

• Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
• Statistical concurrent non-malleable zero knowledge
• Non-malleable zero knowledge: black-box constructions and definitional relationships
• Composable long-term security with rewinding
• Statistical zero knowledge and quantum one-way functions
• Concurrent non-malleable zero knowledge proofs
• Resettable statistical zero-knowledge for NP
• Concurrent non-malleable zero knowledge with adaptive inputs
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• One-message statistical Zero-Knowledge Proofs and space-bounded verifier
• Non-interactive secure computation from one-way functions

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

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