Sciweavers

81 search results - page 14 / 17
» Improving Fast Algebraic Attacks
Sort
View
IANDC
2008
150views more  IANDC 2008»
13 years 7 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch
CODCRY
2011
Springer
242views Cryptology» more  CODCRY 2011»
12 years 11 months ago
Faster 2-Regular Information-Set Decoding
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
SISW
2005
IEEE
14 years 1 months ago
Towards Protecting Sensitive Files in a Compromised System
Protecting sensitive files from a compromised system helps administrator to thwart many attacks, discover intrusion trails, and fast restore the system to a safe state. However, ...
Xin Zhao, Kevin Borders, Atul Prakash
ICALP
2009
Springer
14 years 7 months ago
A Distributed and Oblivious Heap
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Christian Scheideler, Stefan Schmid
AGTIVE
2007
Springer
14 years 1 months ago
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Gernot Veit Batz, Moritz Kroll, Rubino Geiß