Sciweavers

222 search results - page 24 / 45
» How to Forget a Secret
Sort
View
TIFS
2010
130views more  TIFS 2010»
14 years 4 months ago
On the Insecurity of Proactive RSA in the URSA Mobile Ad Hoc Network Access Control Protocol
Access control is the fundamental security service in ad hoc groups. It is needed not only to prevent unauthorized entities from joining the group, but also to bootstrap other secu...
Stanislaw Jarecki, Nitesh Saxena
89
Voted
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 1 months ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman
ASIACRYPT
2003
Springer
15 years 3 months ago
Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking
We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). ...
Dwaine E. Clarke, Srinivas Devadas, Marten van Dij...
ESWS
2007
Springer
15 years 4 months ago
The NExT System: Towards True Dynamic Adaptations of Semantic Web Service Compositions
Traditional process support systems typically offer a static composition of atomic tasks to more powerful services. In the real world, however, processes change over time: busines...
Abraham Bernstein, Michael Dänzer
STACS
1992
Springer
15 years 2 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...