FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2950246598> ?p ?o ?g. }

• W2950246598 startingPage "702" @default.
• W2950246598 abstract "Non-malleable codes, defined by Dziembowski, Pietrzak and Wichs (ICS ’10), provide roughly the following guarantee: if a codeword c encoding some message x is tampered to c′ = f(c) such that c′ 6= c, then the tampered message x′ contained in c′ reveals no information about x. Nonmalleable codes have applications to immunizing cryptosystems against tampering attacks and related-key attacks. One cannot have an efficient non-malleable code that protects against all efficient tampering functions f . However, in this work we show “the next best thing”: for any polynomial bound s given a-priori, there is an efficient non-malleable code that protects against all tampering functions f computable by a circuit of size s. More generally, for any family of tampering functions F of size |F| ≤ 2, there is an efficient non-malleable code that protects against all f ∈ F . The rate of our codes, defined as the ratio of message to codeword size, approaches 1. Our results are information-theoretic and our main proof technique relies on a careful probabilistic method argument using limited independence. As a result, we get an efficiently samplable family of efficient codes, such that a random member of the family is non-malleable with overwhelming probability. Alternatively, we can view the result as providing an efficient non-malleable code in the “common reference string” (CRS) model. We also introduce a new notion of non-malleable key derivation, which uses randomness x to derive a secret key y = h(x) in such a way that, even if x is tampered to a different value x′ = f(x), the derived key y′ = h(x′) does not reveal any information about y. Our results for non-malleable key derivation are analogous to those for non-malleable codes. As a useful tool in our analysis, we rely on the notion of “leakage-resilient storage” of Davi, Dziembowski and Venturi (SCN ’10) and, as a result of independent interest, we also significantly improve on the parameters of such schemes. ∗EPFL. Lausanne, Switzerland. E-mail: sebastian.faust@epfl.ch. †Aarhus University. Aarhus, Denmark. E-mail pratyay@cs.au.dk. Research supported by a European Research Commission Starting Grant (no. 279447), the CTIC and CFEM research center. ‡Sapienza University. Rome, Italy. E-mail: daniele.venturi@uniroma1.it. §Northeastern University. Boston, MA, USA. E-mail: wichs@ccs.neu.edu. Research supported by NSF grant 1314722." @default.
• W2950246598 created "2019-06-27" @default.
• W2950246598 creator A5028263902 @default.
• W2950246598 creator A5056686723 @default.
• W2950246598 creator A5058929075 @default.
• W2950246598 creator A5066436044 @default.
• W2950246598 date "2013-01-01" @default.
• W2950246598 modified "2023-10-02" @default.
• W2950246598 title "Efficient Non-Malleable Codes and Key-Derivation for Poly-Size Tampering Circuits." @default.
• W2950246598 cites W1489183424 @default.
• W2950246598 cites W1490273987 @default.
• W2950246598 cites W1588553798 @default.
• W2950246598 cites W1597805936 @default.
• W2950246598 cites W1606216659 @default.
• W2950246598 cites W1624528701 @default.
• W2950246598 cites W1663689473 @default.
• W2950246598 cites W1981712957 @default.
• W2950246598 cites W2066425771 @default.
• W2950246598 cites W2097651164 @default.
• W2950246598 cites W2099219181 @default.
• W2950246598 cites W2106066551 @default.
• W2950246598 cites W2114924587 @default.
• W2950246598 cites W2118629598 @default.
• W2950246598 cites W2140805804 @default.
• W2950246598 cites W2155441237 @default.
• W2950246598 cites W2156439207 @default.
• W2950246598 cites W2160586212 @default.
• W2950246598 cites W2165192120 @default.
• W2950246598 cites W2166362740 @default.
• W2950246598 cites W2181974462 @default.
• W2950246598 cites W2397876230 @default.
• W2950246598 cites W2406394604 @default.
• W2950246598 cites W2909978789 @default.
• W2950246598 cites W2911777915 @default.
• W2950246598 cites W2913985088 @default.
• W2950246598 cites W3021199033 @default.
• W2950246598 cites W78558797 @default.
• W2950246598 cites W92989823 @default.
• W2950246598 cites W2611751279 @default.
• W2950246598 hasPublicationYear "2013" @default.
• W2950246598 type Work @default.
• W2950246598 sameAs 2950246598 @default.
• W2950246598 citedByCount "10" @default.
• W2950246598 countsByYear W29502465982014 @default.
• W2950246598 countsByYear W29502465982017 @default.
• W2950246598 countsByYear W29502465982018 @default.
• W2950246598 countsByYear W29502465982019 @default.
• W2950246598 countsByYear W29502465982020 @default.
• W2950246598 countsByYear W29502465982021 @default.
• W2950246598 crossrefType "posted-content" @default.
• W2950246598 hasAuthorship W2950246598A5028263902 @default.
• W2950246598 hasAuthorship W2950246598A5056686723 @default.
• W2950246598 hasAuthorship W2950246598A5058929075 @default.
• W2950246598 hasAuthorship W2950246598A5066436044 @default.
• W2950246598 hasConcept C105795698 @default.
• W2950246598 hasConcept C11413529 @default.
• W2950246598 hasConcept C118615104 @default.
• W2950246598 hasConcept C125112378 @default.
• W2950246598 hasConcept C153207627 @default.
• W2950246598 hasConcept C177264268 @default.
• W2950246598 hasConcept C199360897 @default.
• W2950246598 hasConcept C26517878 @default.
• W2950246598 hasConcept C2776760102 @default.
• W2950246598 hasConcept C33923547 @default.
• W2950246598 hasConcept C38652104 @default.
• W2950246598 hasConcept C41008148 @default.
• W2950246598 hasConcept C57273362 @default.
• W2950246598 hasConcept C80444323 @default.
• W2950246598 hasConceptScore W2950246598C105795698 @default.
• W2950246598 hasConceptScore W2950246598C11413529 @default.
• W2950246598 hasConceptScore W2950246598C118615104 @default.
• W2950246598 hasConceptScore W2950246598C125112378 @default.
• W2950246598 hasConceptScore W2950246598C153207627 @default.
• W2950246598 hasConceptScore W2950246598C177264268 @default.
• W2950246598 hasConceptScore W2950246598C199360897 @default.
• W2950246598 hasConceptScore W2950246598C26517878 @default.
• W2950246598 hasConceptScore W2950246598C2776760102 @default.
• W2950246598 hasConceptScore W2950246598C33923547 @default.
• W2950246598 hasConceptScore W2950246598C38652104 @default.
• W2950246598 hasConceptScore W2950246598C41008148 @default.
• W2950246598 hasConceptScore W2950246598C57273362 @default.
• W2950246598 hasConceptScore W2950246598C80444323 @default.
• W2950246598 hasLocation W29502465981 @default.
• W2950246598 hasOpenAccess W2950246598 @default.
• W2950246598 hasPrimaryLocation W29502465981 @default.
• W2950246598 hasRelatedWork W1912212934 @default.
• W2950246598 hasRelatedWork W1996716779 @default.
• W2950246598 hasRelatedWork W2097651164 @default.
• W2950246598 hasRelatedWork W2099219181 @default.
• W2950246598 hasRelatedWork W2106066551 @default.
• W2950246598 hasRelatedWork W2118629598 @default.
• W2950246598 hasRelatedWork W2264903995 @default.
• W2950246598 hasRelatedWork W2395281807 @default.
• W2950246598 hasRelatedWork W2397208260 @default.
• W2950246598 hasRelatedWork W2416422559 @default.
• W2950246598 hasRelatedWork W2417650483 @default.
• W2950246598 hasRelatedWork W2433413249 @default.
• W2950246598 hasRelatedWork W2625364733 @default.
• W2950246598 hasRelatedWork W2909978789 @default.

• next