One-message zero knowledge and non-malleable commitments
type: Item
instance of: scholarly article
title: One-message zero knowledge and non-malleable commitments
zbMATH Open document ID: 1443.94047
DOI: 10.1007/978-3-030-03807-6_8
author: Nir Bitansky
author: Huijia Lin
publication date: 2018-12-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6992092
MaRDI profile type: Publication
full work available at URL: 978-3-030-03807-6 8
OpenAlex ID: W2886744985
cites work: Two-message witness indistinguishability and secure computation in the plain model from new assumptions
cites work: Round optimal concurrent MPC via strong simulation
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Derandomization in Cryptography
cites work: Theory of Cryptography
cites work: On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
cites work: Adaptive hardness and composable security in the plain model from standard assumptions
cites work: Concurrent Non-Malleable Commitments (and More) in 3 Rounds
cites work: Four-round concurrent non-malleable commitments from one-way functions
cites work: Nonmalleable Cryptography
cites work: Counterexamples to Hardness Amplification beyond Negligible
cites work: Zaps and Their Applications
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: Concurrently Secure Computation in Constant Rounds
cites work: On the Exact Round Complexity of Self-composable Two-Party Computation
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Definitions and properties of zero-knowledge proof systems
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: Constant round non-malleable protocols using one way functions
cites work: Textbook non-malleable commitments
cites work: Round optimal concurrent non-malleability from polynomial hardness
cites work: Another step towards realizing random oracles: non-malleable point obfuscation
cites work: Non-malleability amplification
cites work: Constant-round non-malleable commitments from any one-way function
cites work: Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
cites work: Concurrent Non-malleable Commitments from Any One-Way Function
cites work: Q4434874
cites work: Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
cites work: Adaptive One-Way Functions and Applications
cites work: New and improved constructions of non-malleable cryptographic protocols
cites work: New notions of security
cites work: Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
cites work: Formalizing Human Ignorance
cites work: Random Oracles and Auxiliary Input
description: scientific article; zbMATH DE number 6992092