One-message zero knowledge and non-malleable commitments
From MaRDI portal
Publication:1629409
DOI10.1007/978-3-030-03807-6_8zbMath1443.94047OpenAlexW2886744985MaRDI QIDQ1629409
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_8
Related Items
Non-malleable codes for bounded parallel-time tampering ⋮ One-message zero knowledge and non-malleable commitments ⋮ Non-malleable commitments against quantum attacks ⋮ Maliciously-secure MrNISC in the plain model ⋮ Concurrently composable non-interactive secure computation ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Post-quantum multi-party computation ⋮ Black-box non-interactive non-malleable commitments ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ On the CCA compatibility of public-key infrastructure ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier
Cites Work
- Unnamed Item
- Definitions and properties of zero-knowledge proof systems
- One-message zero knowledge and non-malleable commitments
- Another step towards realizing random oracles: non-malleable point obfuscation
- 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
- Formalizing Human Ignorance
- Counterexamples to Hardness Amplification beyond Negligible
- Concurrently Secure Computation in Constant Rounds
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
- New notions of security
- New and improved constructions of non-malleable cryptographic protocols
- Adaptive One-Way Functions and Applications
- Random Oracles and Auxiliary Input
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- The Knowledge Complexity of Interactive Proof Systems
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Nonmalleable Cryptography
- Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
- Non-malleability amplification
- Textbook non-malleable commitments
- Derandomization in Cryptography
- New Techniques for Noninteractive Zero-Knowledge
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Zaps and Their Applications
- Concurrent Non-malleable Commitments from Any One-Way Function
- On the Exact Round Complexity of Self-composable Two-Party Computation
- Theory of Cryptography
- Theory of Cryptography
