One-message zero knowledge and non-malleable commitments
From MaRDI portal
Publication:1629409
DOI10.1007/978-3-030-03807-6_8zbMATH Open1443.94047OpenAlexW2886744985MaRDI QIDQ1629409FDOQ1629409
Authors: Nir Bitansky, Huijia Lin 
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_8
Recommendations
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Constant-round non-malleable commitments from any one-way function
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Concurrent Non-malleable Commitments from Any One-Way Function
- Constant-round non-malleable commitments from sub-exponential one-way functions
Cites Work
- Formalizing human ignorance
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Constant-round non-malleable commitments from any one-way function
- Definitions and properties of zero-knowledge proof systems
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- The Knowledge Complexity of Interactive Proof Systems
- Derandomization in Cryptography
- Zaps and Their Applications
- Constant-round non-malleable commitments from sub-exponential one-way functions
- New and improved constructions of non-malleable cryptographic protocols
- Adaptive One-Way Functions and Applications
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Non-malleability amplification
- Constant round non-malleable protocols using one way functions
- Concurrent Non-malleable Commitments from Any One-Way Function
- On the exact round complexity of self-composable two-party computation
- New notions of security: achieving universal composability without trusted setup
- Title not available (Why is that?)
- Random Oracles and Auxiliary Input
- Another step towards realizing random oracles: non-malleable point obfuscation
- On non-black-box simulation and the impossibility of approximate obfuscation
- New techniques for noninteractive zero-knowledge
- Theory of Cryptography
- Nonmalleable Cryptography
- Theory of Cryptography
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- One-message zero knowledge and non-malleable commitments
- Four-round concurrent non-malleable commitments from one-way functions
- Round optimal concurrent MPC via strong simulation
- Round optimal concurrent non-malleability from polynomial hardness
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Adaptive hardness and composable security in the plain model from standard assumptions
- Concurrent non-malleable commitments (and more) in 3 rounds
- Counterexamples to hardness amplification beyond negligible
- Concurrently secure computation in constant rounds
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Textbook non-malleable commitments
Cited In (20)
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- On non-uniform security for black-box non-interactive CCA commitments
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Post-quantum multi-party computation
- One-message zero knowledge and non-malleable commitments
- Non-malleable codes for bounded parallel-time tampering
- Two-round concurrent 2PC from sub-exponential LWE
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Theory of Cryptography
- Maliciously-secure MrNISC in the plain model
- Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
- Concurrently composable non-interactive secure computation
- Non-malleable commitments against quantum attacks
- Black-box non-interactive non-malleable commitments
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- On the CCA compatibility of public-key infrastructure
- Weak Zero-Knowledge beyond the Black-Box Barrier
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier
- Two-round maliciously secure computation with super-polynomial simulation
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
This page was built for publication: One-message zero knowledge and non-malleable commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1629409)
