Sciweavers

993 search results - page 135 / 199
» The Complexity of Probabilistic EL
Sort
View
WISA
2009
Springer
14 years 2 months ago
You Cannot Hide behind the Mask: Power Analysis on a Provably Secure S-Box Implementation
Power analysis has shown to be successful in breaking symmetric cryptographic algorithms implemented on low resource devices. Prompted by the breaking of many protected implementat...
J. Pan, J. I. den Hartog, Jiqiang Lu
GI
2004
Springer
14 years 1 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
VLDB
2004
ACM
114views Database» more  VLDB 2004»
14 years 1 months ago
Hardware Acceleration in Commercial Databases: A Case Study of Spatial Operations
Traditional databases have focused on the issue of reducing I/O cost as it is the bottleneck in many operations. As databases become increasingly accepted in areas such as Geograp...
Nagender Bandi, Chengyu Sun, Amr El Abbadi, Divyak...
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
14 years 7 days ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
CLIMA
2004
13 years 9 months ago
Weighted Multi Dimensional Logic Programs
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
Pierangelo Dell'Acqua