[PDF] Top 20 Privacy Amplification from Non-malleable Codes
Has 10000 "Privacy Amplification from Non-malleable Codes" found on our website. Below are the top 20 most common "Privacy Amplification from Non-malleable Codes".
Privacy Amplification from Non-malleable Codes
... the privacy amplification proto- col given by Dodis and Wichs ...“seeded Non-malleable extractors (NME)”, which has the property that the output of the extractor looks uniform, even given its ... See full document
37
Continuously Non-Malleable Codes with Split-State Refresh
... Unfortunately, we cannot generalize the above proof strategy to multiple rounds. Indeed, Faust et al. exploit the fact that the leakage-resilient storage scheme remains secure even when the adversary is allowed to obtain ... See full document
52
Information-theoretic Local Non-malleable Codes and their Applications
... correcting codes were introduced by Katz and Trevisan (STOC 2000) when they explored the question of de- coding ...decodable codes are coding schemes which have an additional “local decode” procedure: in ... See full document
26
Non-Malleable Codes for Partial Functions with Manipulation Detection
... Non-malleable codes ( NMC ) were introduced by Dziembowski, Pietrzak and Wichs [27] as a relaxation of error correction and error detection codes, aiming to provide strong privacy but ... See full document
30
Locally Decodable and Updatable Non-Malleable Codes and Their Applications
... of non-malleable codes was defined by Dziembowski, Pietrzak and Wichs [23] as a relaxation of error-correcting ...is non-malleable against a tampering function if by tampering with the ... See full document
32
Short Non-Malleable Codes from Related-Key Secure Block Ciphers
... Non-malleable codes (NMCs) were introduced by Dziembowski, Pietrzak and Wichs in 2010 ...perspective from classical error-correcting codes: when correction is not possible, decoding is ... See full document
17
Explicit Non-malleable Codes Resistant to Permutations and Perturbations
... to non-malleable commitments, as one of the first direct applications of non-malleable codes to computational ...that non- malleable string commitments can be “entirely ... See full document
53
Non-Malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering
... the non-malleable extractor described above (with the modifications that we have specified) is now used as a seed in a linear seeded extractor applied to an even larger pseudorandom slice of ...sample ... See full document
37
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification
... a non-malleable extractor, we manage to construct a PA protocol (which is the main and most direct application of a non-malleable extractor) using this weaker notion of a ... See full document
20
Non-Malleable Codes with Split-State Refresh
... existing codes the encoding process is considerably more complex than the decoding ...leakage from this process could be leakage on the decoded key ... See full document
42
Explicit Non-Malleable Codes Resistant to Permutations
... bit from Bob until Alice reveals it to him; on the other hand, Alice cannot change the bit inside the token once she has sent it to ...a non-malleable bit commitment scheme, in that if Bob plays a ... See full document
48
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions
... is malleable; hence, we can instantiate our construction based on standard cryptographic as- sumptions, such as the existence of one-to-one one-way functions (which imply standard perfectly binding and ... See full document
30
Efficient Non-Malleable Codes and Key-Derivation for Poly-Size Tampering Circuits
... efficient codes, such that, with overwhelming probability, a random member of the family is non-malleable ...h from a t-wise independent family of hash functions ...efficient ... See full document
26
Revisiting Non-Malleable Secret Sharing
... bits from each share belonging to a party in the set ...with privacy error ...0 non-malleable secret sharing scheme for threshold t = 2 would imply a 2-split-state non-malleable ... See full document
57
Non-Malleable Secret Sharing
... Getting non-malleability from leakage-resilient non-malleable ...leakage-resilience from the underlying non-malleable ...underlying non-malleable code that ... See full document
45
Amplifying Privacy in Privacy Amplification
... of non-malleable extractors [DW09] (which we call adaptive non-malleable extractors) to derive a one-time pad to mask the “non-private” message which should be sent in the second ...use ... See full document
26
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-wise Tampering and Permutations
... Intuitively, the short tag τ should encode some information about the much longer c in a way that makes it hard to change c without changing τ as well, and since the latter is encoded using a non- malleable ... See full document
23
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
... of non-malleable codes is in the setting of tamper-resilient computation (although non-malleable codes have also found connections in other areas of cryptography ... See full document
48
From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes
... suitable non-malleable code (Dziem- bowski et ...continuously non-malleable (Faust et ...of non-malleability can only be achieved if the code is allowed to “self-destruct,” the ... See full document
37
Non-Malleable Codes Against Bounded Polynomial Time Tampering
... However, while most cryptography implies non-trivial derandomization, there seem to be inherent barriers to statements of the converse form. In fact, the so-called “cryptographic” PRG’s yield, in two aspects, much ... See full document
30
Related subjects