Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions

DOI10.1007/978-3-662-48000-7_5zbMath1351.94054OpenAlexW1452114707MaRDI QIDQ3457061

Susumu Kiyoshima

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_5

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments

Cites Work

• Bit commitment using pseudorandomness
• Concurrent zero knowledge, revisited
• Black-Box Constructions of Composable Protocols without Set-Up
• 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
• Concurrent Non-Malleable Zero Knowledge Proofs
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• 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
• Concurrent zero-knowledge
• Statistical Concurrent Non-malleable Zero Knowledge
• Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

This page was built for publication: Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions