Sciweavers

1898 search results - page 80 / 380
» Weak Keys for IDEA
Sort
View
FOSSACS
2006
Springer
14 years 13 days ago
Propositional Dynamic Logic with Recursive Programs
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
Christof Löding, Olivier Serre
BTW
2009
Springer
114views Database» more  BTW 2009»
14 years 3 days ago
Efficient Verification of B-tree Integrity
: The integrity of B-tree structures can become compromised for many reasons. Since these inconsistencies manifest themselves in unpredictable ways, all commercial database managem...
Goetz Graefe, R. Stonecipher
EUROPKI
2008
Springer
13 years 10 months ago
Efficient Generic Forward-Secure Signatures and Proxy Signatures
We propose a generic method to construct forward-secure signature schemes from standard signature schemes. The proposed construction is more computationally efficient than previous...
Basel Alomair, Krishna Sampigethaya, Radha Poovend...
FDTC
2008
Springer
144views Cryptology» more  FDTC 2008»
13 years 10 months ago
Comparative Analysis of Robust Fault Attack Resistant Architectures for Public and Private Cryptosystems
The adaptive and active nature of fault based sidechannel attacks along with the large arsenal of fault injection methods complicates the design of effective countermeasures. To o...
Konrad J. Kulikowski, Zhen Wang, Mark G. Karpovsky
DLT
2008
13 years 10 months ago
Relationally Periodic Sequences and Subword Complexity
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni