Interactive non-malleable codes
From MaRDI portal
Publication:2175939
DOI10.1007/978-3-030-36033-7_9zbMath1455.94153OpenAlexW2991432436MaRDI QIDQ2175939
Abhishek Jain, Vipul Goyal, Nils Fleischhacker, Anat Paskin-Cherniavsky, Slava Radune
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_9
Cryptography (94A60) Other types of codes (94B60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuously non-malleable codes in the split-state model from minimal assumptions
- Non-malleable randomness encoders and their applications
- Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering
- Non-malleable secret sharing for general access structures
- Non-malleable codes for space-bounded tampering
- Non-malleable codes for decision trees
- Rate-optimizing compilers for continuously non-malleable codes
- Non-malleable codes against bounded polynomial time tampering
- Continuous non-malleable codes in the 8-split-state model
- Non-Malleable Encryption: Simpler, Shorter, Stronger
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Optimal Computational Split-state Non-malleable Codes
- A coding theorem for distributed computation
- Non-malleable Codes from Two-Source Extractors
- Tamper and Leakage Resilience in the Split-State Model
- Efficient Error-Correcting Codes for Sliding Windows
- A Tamper and Leakage Resilient von Neumann Architecture
- Non-malleable Reductions and Applications
- Capacity of Non-Malleable Codes
- Capacity of non-malleable codes
- Interactive Coding for Multiparty Protocols
- Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback
- Coding for interactive communication
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Non-Malleable Codes
- Towards Optimal Deterministic Coding for Interactive Communication
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- Non-malleable codes and extractors for small-depth circuits, and affine functions
- Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Non-malleable secret sharing
- Deterministic coding for interactive communication
- Non-malleable codes from additive combinatorics
- Optimal error rates for interactive coding I
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Locally Decodable and Updatable Non-malleable Codes and Their Applications
- From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Non-malleable extractors and codes, with their many tampered extensions
- Constant-rate coding for multiparty interactive communication is impossible
- Textbook non-malleable commitments
- Reliable Communication over Highly Connected Noisy Networks
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Towards coding for maximum errors in interactive communication
- Secure Computation Without Authentication
- Efficient and Explicit Coding for Interactive Communication
- Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
- Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
- Continuous Non-malleable Codes
- Optimal Coding for Streaming Authentication and Interactive Communication
- Continuously non-malleable codes with split-state refresh
- Four-state non-malleable codes with explicit constant rate
This page was built for publication: Interactive non-malleable codes
