[PDF] Top 20 Inception Makes Non-malleable Codes Stronger
Has 10000 "Inception Makes Non-malleable Codes Stronger" found on our website. Below are the top 20 most common "Inception Makes Non-malleable Codes Stronger".
Inception Makes Non-malleable Codes Stronger
... strong non-malleable code is also a persistent continuous non-malleable code with self-destruct in the split-state ...continuous non-malleable codes with self-destruct, ... See full document
26
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures
... split-state non-malleable codes from non-malleable extractors (variations of these objects are defined in Section 2, but are not important for this ... See full document
42
From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes
... [10] non-malleable schemes from chosen-plaintext secure ones, and Lin and Tessaro [37] show how the security of weakly chosen-ciphertext secure schemes can be ... See full document
37
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-wise Tampering and Permutations
... that makes it hard to change c without changing τ as well, and since the latter is encoded using a non- malleable code, one could hope that the over all code is ... See full document
23
Efficient Non-Malleable Codes and Key-Derivation for Poly-Size Tampering Circuits
... This makes the notion of non-malleable codes different from (but conceptually related to) the well-studied notions of non-malleability in cryptography, introduced by the seminal work of ... See full document
26
Short Non-Malleable Codes from Related-Key Secure Block Ciphers
... One possible approach to address physical attacks is to actively protect the implemen- tation of a scheme in a way that prevents the attacks or makes them too expensive to carry out, so that an algorithm hopefully ... See full document
17
Locally Decodable and Updatable Non-Malleable Codes and Their Applications
... a stronger version of non-malleable codes in the split-state setting (called continual non-malleable codes [24]) for their ...expensive non-malleable ... See full document
32
Non-Malleable Codes for Partial Functions with Manipulation Detection
... Abstract. Non-malleable codes were introduced by Dziembowski, Pietrzak and Wichs (ICS ’10) and its main application is the protection of cryp- tographic devices against tampering attacks on ...on ... See full document
30
Leakage-resilient non-malleable codes
... information from it. The leakage will be modeled by allowing the adversary to choose functions Leak L i and Leak R i and learn Leak L i (L) and Leak R i (R) (respectively). The entire process should happen in several ... See full document
26
Optimal Computational Split-state Non-malleable Codes
... strong) non-malleable code into a rate-1, two-state, computational non- malleable ...such codes. Our compiler requires a stronger form of non-malleability, called aug- ... See full document
25
Non-malleable Reductions and Applications
... Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs [DPW10], provide a use- ful message integrity guarantee in situations where traditional error-correction (and even error- detection) ... See full document
34
Upper and Lower Bounds for Continuous Non-Malleable Codes
... Non-malleable codes (NMC). Non-malleable codes were introduced by Dziembowski, Pietrzak and Wichs [36] as a relaxation of error-correcting codes, and are useful in ... See full document
31
Concurrent non-malleable zero-knowledge and simultaneous resettable non-malleable zero-knowledge in constant rounds
... Simultaneous Resettable Zero-Knowledge. The notion of resettable zero-knowledge (rZK) was first intro- duced by Canetti, Goldreich, Goldwasser and Micali (2000). It requires the zero-knowledge condition holds even when ... See full document
15
Non-Malleable Codes Against Bounded Polynomial Time Tampering
... inherently non-uniform (the adversary in the proof is so limited that it does not have time to generate new commitments on its own and therefore must receive them as non-uniform advice when reducing ... See full document
30
An entropy lower bound for non malleable extractors
... the non-malleable extractor nmExt could support min-entropy that is smaller than stated in Theorem 1, then the code C we derive via Lemma 2 would have rate that would violate the lower bound in Theorem ... See full document
16
Revisiting Non-Malleable Secret Sharing
... Can we obtain a construction of threshold non-malleable secret sharing with rate > 0? The problem of improving the rate was mentioned as an explicit open question in [GK18a]. Multiple Tamperings. In the ... See full document
57
Information-theoretic Local Non-malleable Codes and their Applications
... correcting codes provide no guarantees for larger classes of tam- pering ...of non-malleable codes. Informally, non-malleable codes are codes such that for all ... See full document
26
Continuously Non-Malleable Codes with Split-State Refresh
... Proof strategy. Although our construction shares similarities with previous work, our proof techniques diverge significantly from the ones in [33, 36]. The main trick of [36] is to show that given one half of the ... See full document
52
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions
... Non-malleable codes. Only a few constructions of continuously non-malleable codes are known (besides the already mentioned constructions of ...continuous non-malleability ... See full document
30
Non-Malleable Functions and Their Applications
... already pin-pointed by [BCM11, ABPP14], this assumption is undesirable because many natural and practical RKDT classes are not claw-free. The second method is directly modifying the RKA security experiment to disallow ... See full document
35
Related subjects