[PDF] Top 20 Memoria y literatura: escribir desde el exilio

... achieve optimal parameters [MW97, DKRS06, DW09, RW03, KR09, CKOR10, DLWZ11, CRS12, Li12a, ...first non- trivial protocol which takes one-round and works when the entropy rate of X is bigger than ... See full document

... seeded non-malleable extractor defined ...two-round privacy amplification protocols with optimal entropy loss can be constructed using explicit seeded ... See full document

... asymptotically optimal seed length [12] and through the analysis of Kanukurthi and Reyzin [15], it can be seen that the protocol of [24] achieves entropy loss of Θ(κ 2 ) and takes Θ(κ) rounds of ...the ... See full document

... of privacy amplification is to enable two parties with a weak (entropic) secret w to agree on a random key K whose distribution is close to ...a privacy amplification protocol is considered to ... See full document

... called non-malleable ...designing privacy amplification ...for optimal protocols, and showed that a random construction achieves optimal ...for non-malleable ... See full document

... PA protocols with optimal entropy loss L = Θ(log (1/ε)) for any ...called non-malleable extractors, whose existence was shown in ...such protocols are known, and all known ... See full document

... in arbitrary ways), on the other hand, is much more ...first non-trivial protocol in this ...the entropy rate of the weakly-random secret X is bigger than ...give protocols that work for ... See full document

... continuous non-malleability arises from the need of the security reduction to simulate the interactive tampering oracle, without knowing the message underlying the “chal- lenge” ... See full document

... any non-malleable code in the 2-split-state model gives a 2 out of 2 secret sharing scheme, if one views the two split states as two shares ...any non-malleable code in the interleaved 2-split ... See full document

... of non-malleable codes of rate close to 1 (with polynomial time encoding and decoding, and inverse polynomially small error) for an arbitrary family of size exp(n c ) for any fixed c > ... See full document

... so-called non-malleable codes introduced by Dziem- bowski, Pietrzak and Wichs in 2010 ...is non- malleable if an adversary that learns C = Enc(M ) is not able to produce C 0 = h(C) such that ... See full document

... Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs [DPW10], provide a useful message integrity guarantee in situations where traditional error-correction (and even error-detection) is ... See full document

... several privacy-aware access control models proposed for relational DBMSs to identify the characteristics of privacy policies to be ...[2] privacy policies require rule based and enforcement ... See full document

... (strong) non-malleable codes, and this result was im- proved by [CG14a] who showed that the optimal rate of these codes is ...continuous non-malleable codes against ... See full document

... of non-malleable primitive, but restrict our attention to basic functions, rather than one-way/hash functions considered in prior works [BCFW09, ...between non-malleability and ... See full document

... P-certificate system, an efficient prover can generate a short certificate π of a fixed polynomial length (inde- pendent of the running-time and size of M) for a tuple ( M, x, y ) in a prior bounded polynomial time in | ... See full document

... studied non-malleable code when the tampering function is allowed to tamper codeword as long as it does not decodes to a special symbol ...of non-malleable codes in the information theoretic ... See full document

... – First, we derive new bounds on the secure sketch min-entropy loss for PUF- induced distributions with practical relevance. Our bounds are considerably tighter than the well-known (n−k) formula, hereby ... See full document

... function privacy for a PE are mutually exclusive in the sense that one does not necessarily imply the ...function privacy is significantly more challenging [12, ... See full document

... tamper almost half the shares, and still ensured that the adversary cannot cause the reconstruction procedure to output an incorrect message (except with exponentially small error ...gave almost ... See full document