Local Non-malleable Codes in the Bounded Retrieval Model
| Autor: | Dana Dachman-Soled, Aria Shahverdi, Mukul Kulkarni |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Theoretical computer science
010201 computation theory & mathematics Computer science Bounded function 0202 electrical engineering electronic engineering information engineering Code (cryptography) 020201 artificial intelligence & image processing Data_CODINGANDINFORMATIONTHEORY 0102 computer and information sciences 02 engineering and technology 01 natural sciences Random access |
| Zdroj: | Public-Key Cryptography – PKC 2018 ISBN: 9783319765808 Public Key Cryptography (2) |
| Popis: | In a recent result, Dachman-Soled et al. (TCC ’15) proposed a new notion called locally decodable and updatable non-malleable codes, which informally, provides the security guarantees of a non-malleable code while also allowing for efficient random access. They also considered locally decodable and updatable non-malleable codes that are leakage-resilient, allowing for adversaries who continually leak information in addition to tampering. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|