FRINK Linked Data Fragments server

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

• W2103149732 endingPage "353" @default.
• W2103149732 startingPage "335" @default.
• W2103149732 abstract "Much recent work in cryptography attempts to build secure schemes in the presence of side-channel or caused by malicious software, like computer viruses. In this setting, the adversary may obtain some additional information (beyond the control of the scheme designer) about the internal secret state of a cryptographic scheme. Here, we consider key-evolution schemes that allow a user to evolve a secret-key K1 via a deterministic function f, to get updated keysK2 = f(K1), K3 = f(K2), . . .. Such a scheme is leakage-resilient if an adversary that can leak on the first i steps of the evolution process does not get any useful information about any future keys. For such schemes, one must assume some restriction on the complexity of the to prevent pre-computation attacks, where the on a key Ki simply pre-computes a future key Ki+t and even a single bit on it.Much of the prior work on this problem, and the restrictions made therein, can be divided into two types. Theoretical work offers rigor and provable security, but at the cost of having to make strong restrictions on the type of and designing complicated schemes to make standard reduction-based proof techniques go through (an example of such an assumption is the computation leaks axiom). On the other hand, practical work focuses on simple and efficient schemes, often at the cost of only achieving an intuitive notion of security without formal well-specified guarantees.In this paper, we complement the two tracks via a middle-of-the-road approach. On one hand, we rely on the random-oracle model. On the other hand, we show that even in the random-oracle model, designing secure leakage-resilient schemes is susceptible to pitfalls. For example, just assuming that cannot evaluate the random can be misleading. Instead, we define a new model in which we assume that the leakage can be any arbitrary space bounded computation that can make random oracle calls itself. We connect the spacecomplexity of a computation in the random-oracle modeling to the pebbling complexity on graphs. Using this connection, we derive meaningful guarantees for relatively simple key-evolution constructions.Our scheme is secure also against a large and natural class of active attacks, where an attacker can leak as well as tamper with the internals of a device. This is especially important if the key evolution is performed on a PC that can be attacked by a virus, a setting considered by prior work in the bounded retrieval model (BRM)). This paper provides the first scheme were the adversary in the BRM can also modify the data stored on the machine." @default.
• W2103149732 created "2016-06-24" @default.
• W2103149732 creator A5008597461 @default.
• W2103149732 creator A5034199091 @default.
• W2103149732 creator A5058929075 @default.
• W2103149732 date "2011-01-01" @default.
• W2103149732 modified "2023-10-16" @default.
• W2103149732 title "Key-Evolution Schemes Resilient to Space-Bounded Leakage" @default.
• W2103149732 cites W1483290420 @default.
• W2103149732 cites W1485544780 @default.
• W2103149732 cites W1494600236 @default.
• W2103149732 cites W1498503799 @default.
• W2103149732 cites W1508077776 @default.
• W2103149732 cites W1520746637 @default.
• W2103149732 cites W1547517307 @default.
• W2103149732 cites W1549228503 @default.
• W2103149732 cites W1563465674 @default.
• W2103149732 cites W1569144247 @default.
• W2103149732 cites W1573157032 @default.
• W2103149732 cites W1588518948 @default.
• W2103149732 cites W1591813095 @default.
• W2103149732 cites W1592625985 @default.
• W2103149732 cites W1603601034 @default.
• W2103149732 cites W1606216659 @default.
• W2103149732 cites W1606729219 @default.
• W2103149732 cites W1724890242 @default.
• W2103149732 cites W1752847028 @default.
• W2103149732 cites W1819824216 @default.
• W2103149732 cites W1875376608 @default.
• W2103149732 cites W1897761346 @default.
• W2103149732 cites W1970187925 @default.
• W2103149732 cites W2101248381 @default.
• W2103149732 cites W2103149732 @default.
• W2103149732 cites W2107691219 @default.
• W2103149732 cites W2128846062 @default.
• W2103149732 cites W2133701468 @default.
• W2103149732 cites W2154909745 @default.
• W2103149732 cites W2167208487 @default.
• W2103149732 cites W2169985476 @default.
• W2103149732 cites W236432643 @default.
• W2103149732 doi "https://doi.org/10.1007/978-3-642-22792-9_19" @default.
• W2103149732 hasPublicationYear "2011" @default.
• W2103149732 type Work @default.
• W2103149732 sameAs 2103149732 @default.
• W2103149732 citedByCount "32" @default.
• W2103149732 countsByYear W21031497322013 @default.
• W2103149732 countsByYear W21031497322014 @default.
• W2103149732 countsByYear W21031497322015 @default.
• W2103149732 countsByYear W21031497322016 @default.
• W2103149732 countsByYear W21031497322017 @default.
• W2103149732 countsByYear W21031497322018 @default.
• W2103149732 countsByYear W21031497322019 @default.
• W2103149732 countsByYear W21031497322020 @default.
• W2103149732 countsByYear W21031497322021 @default.
• W2103149732 crossrefType "book-chapter" @default.
• W2103149732 hasAuthorship W2103149732A5008597461 @default.
• W2103149732 hasAuthorship W2103149732A5034199091 @default.
• W2103149732 hasAuthorship W2103149732A5058929075 @default.
• W2103149732 hasBestOaLocation W21031497321 @default.
• W2103149732 hasConcept C120314980 @default.
• W2103149732 hasConcept C134306372 @default.
• W2103149732 hasConcept C139719470 @default.
• W2103149732 hasConcept C162324750 @default.
• W2103149732 hasConcept C26517878 @default.
• W2103149732 hasConcept C2777042071 @default.
• W2103149732 hasConcept C33923547 @default.
• W2103149732 hasConcept C34388435 @default.
• W2103149732 hasConcept C38652104 @default.
• W2103149732 hasConcept C41008148 @default.
• W2103149732 hasConcept C80444323 @default.
• W2103149732 hasConceptScore W2103149732C120314980 @default.
• W2103149732 hasConceptScore W2103149732C134306372 @default.
• W2103149732 hasConceptScore W2103149732C139719470 @default.
• W2103149732 hasConceptScore W2103149732C162324750 @default.
• W2103149732 hasConceptScore W2103149732C26517878 @default.
• W2103149732 hasConceptScore W2103149732C2777042071 @default.
• W2103149732 hasConceptScore W2103149732C33923547 @default.
• W2103149732 hasConceptScore W2103149732C34388435 @default.
• W2103149732 hasConceptScore W2103149732C38652104 @default.
• W2103149732 hasConceptScore W2103149732C41008148 @default.
• W2103149732 hasConceptScore W2103149732C80444323 @default.
• W2103149732 hasLocation W21031497321 @default.
• W2103149732 hasLocation W21031497322 @default.
• W2103149732 hasOpenAccess W2103149732 @default.
• W2103149732 hasPrimaryLocation W21031497321 @default.
• W2103149732 hasRelatedWork W1587227328 @default.
• W2103149732 hasRelatedWork W1596201972 @default.
• W2103149732 hasRelatedWork W1880774266 @default.
• W2103149732 hasRelatedWork W2160425906 @default.
• W2103149732 hasRelatedWork W2329452785 @default.
• W2103149732 hasRelatedWork W2356380379 @default.
• W2103149732 hasRelatedWork W2363925233 @default.
• W2103149732 hasRelatedWork W2364808845 @default.
• W2103149732 hasRelatedWork W2998813341 @default.
• W2103149732 hasRelatedWork W3027915305 @default.
• W2103149732 isParatext "false" @default.
• W2103149732 isRetracted "false" @default.
• W2103149732 magId "2103149732" @default.

• next