Continuously non-malleable codes in the split-state model from minimal assumptions
From MaRDI portal
Publication:776002
DOI10.1007/978-3-319-96878-0_21zbMATH Open1457.94169OpenAlexW2884935367MaRDI QIDQ776002FDOQ776002
Authors: Rafail Ostrovsky, Giuseppe Persiano, D. Venturi, Ivan Visconti 
Publication date: 30 June 2020
Full work available at URL: http://hdl.handle.net/11573/1196790
Recommendations
Cited In (18)
- Continuously non-malleable codes in the split-state model
- Non-malleable encryption: simpler, shorter, stronger
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
- Continuously non-malleable codes against bounded-depth tampering
- Rate-optimizing compilers for continuously non-malleable codes
- Non-malleable codes for bounded parallel-time tampering
- Inception makes non-malleable codes stronger
- Continuously non-malleable codes with split-state refresh
- Non-malleable secret sharing against bounded joint-tampering attacks in the plain model
- Continuously non-malleable secret sharing for general access structures
- Continuous non-malleable codes in the 8-split-state model
- Practical continuously non-malleable randomness encoders in the random oracle model
- Interactive non-malleable codes
- Continuously non-malleable codes with split-state refresh
- Upper and lower bounds for continuous non-malleable codes
- Continuously non-malleable secret sharing: joint tampering, plain model and capacity
- Continuous non-malleable codes
- Non-malleable Codes with Split-State Refresh
This page was built for publication: Continuously non-malleable codes in the split-state model from minimal assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776002)
