Non-malleable codes for bounded parallel-time tampering
From MaRDI portal
Recommendations
- Non-malleable codes for space-bounded tampering
- Linear-time non-malleable codes in the bit-wise independent tampering model
- Continuously non-malleable codes against bounded-depth tampering
- Non-malleable codes against lookahead tampering
- Explicit non-malleable codes against bit-wise tampering and permutations
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
Cites work
- Adaptive One-Way Functions and Applications
- Advances in Cryptology - CRYPTO 2003
- Asymptotically Fast Factorization of Integers
- Block-wise non-malleable codes
- Capacity of non-malleable codes
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Computationally Sound Proofs
- Concurrent non-malleable commitments (and more) in 3 rounds
- Concurrent Non-malleable Commitments from Any One-Way Function
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Constant-round non-malleable commitments from sub-exponential one-way functions
- Continuous verifiable delay functions
- Continuously non-malleable codes in the split-state model from minimal assumptions
- Derandomization in Cryptography
- Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
- Efficient verifiable delay functions
- Explicit two-source extractors and resilient functions
- Four-round concurrent non-malleable commitments from one-way functions
- From single-bit to multi-bit public-key encryption via non-malleable codes
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 2204782 (Why is no real title available?)
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Locally decodable and updatable non-malleable codes and their applications
- Multi-collision resistance: a paradigm for keyless hash functions
- Multi-collision resistant hash functions and their applications
- New and improved constructions of non-malleable cryptographic protocols
- New independent source extractors with exponential improvement
- Non-interactive non-malleability from quantum supremacy
- Non-interactive Zaps and New Techniques for NIZK
- Non-malleability amplification
- Non-malleable codes
- Non-malleable codes against bounded polynomial time tampering
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Non-malleable codes for bounded depth, bounded fan-in circuits
- Non-malleable codes for decision trees
- Non-malleable codes for space-bounded tampering
- Non-Malleable Codes from Additive Combinatorics
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- Non-malleable encryption: simpler, shorter, stronger
- Non-malleable extractors and codes, with their many tampered extensions
- Non-malleable reductions and applications
- On the security of time-lock puzzles and timed commitments
- One-message zero knowledge and non-malleable commitments
- Optimal computational split-state non-malleable codes
- Round optimal concurrent non-malleability from polynomial hardness
- Simple verifiable delay functions
- Tamper and Leakage Resilience in the Split-State Model
- TARDIS: a foundation of time-lock puzzles in UC
- Textbook non-malleable commitments
- The algebraic group model and its applications
- Theory of Cryptography
- Time-lock puzzles from randomized encodings
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- White-box vs. black-box complexity of search problems: Ramsey and graph property testing
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
Cited in
(19)- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- Non-malleable codes for space-bounded tampering
- Linear-time non-malleable codes in the bit-wise independent tampering model
- Non-malleable codes against lookahead tampering
- Non-malleability against polynomial tampering
- Interactive non-malleable codes
- Non-malleable codes against bounded polynomial time tampering
- Non-malleable time-lock puzzles and applications
- Non-malleable codes
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Non-malleable codes for bounded depth, bounded fan-in circuits
- (Nondeterministic) hardness vs. non-malleability
- Continuously non-malleable codes against bounded-depth tampering
- (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates
- Non-malleable fuzzy extractors
- Non-malleable codes with optimal rate for poly-size circuits
- Interactive non-malleable codes against desynchronizing attacks in the multi-party setting
- Seedless condensers for efficiently samplable sources
- Non-malleable codes for partial functions with manipulation detection
This page was built for publication: Non-malleable codes for bounded parallel-time tampering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129009)
