Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
From MaRDI portal
Publication:1631329
DOI10.1007/978-3-030-03810-6_9zbMath1430.94066OpenAlexW2795098159MaRDI QIDQ1631329
Luisa Siniscalchi, Tomasz Kazana, Varun Raj, Maciej Obremski, Ivan B. Damgård
Publication date: 6 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_9
Related Items
Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments, Continuously non-malleable codes against bounded-depth tampering, Non-malleable encryption: simpler, shorter, stronger, Continuously non-malleable codes in the split-state model
Cites Work
- Unnamed Item
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- Four-round concurrent non-malleable commitments from one-way functions
- Round optimal concurrent non-malleability from polynomial hardness
- Inception makes non-malleable codes stronger
- Non-malleability vs. CCA-security: the case of commitments
- Continuous non-malleable codes in the 8-split-state model
- Improved OR-Composition of Sigma-Protocols
- Optimal Computational Split-state Non-malleable Codes
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds
- Non-malleable Codes from Two-Source Extractors
- Round-Efficient Black-Box Construction of Composable Multi-Party Computation
- Black-Box Constructions of Composable Protocols without Set-Up
- Tamper and Leakage Resilience in the Split-State Model
- A Tamper and Leakage Resilient von Neumann Architecture
- Capacity of non-malleable codes
- BiTR: Built-in Tamper Resilience
- Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
- New and improved constructions of non-malleable cryptographic protocols
- Non-Malleable Codes
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
- Non-malleable codes from additive combinatorics
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Tamper Detection and Continuous Non-malleable Codes
- From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
- Non-malleable extractors and codes, with their many tampered extensions
- Textbook non-malleable commitments
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Non-black-box simulation from one-way functions and applications to resettable security
- Concurrently Composable Security with Shielded Super-Polynomial Simulators
- Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
- Continuous Non-malleable Codes
- Theory of Cryptography
