Sciweavers

209 search results - page 13 / 42
» ideal 2009
Sort
View
CSFW
2009
IEEE
15 years 4 months ago
Universally Composable Symmetric Encryption
For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities...
Ralf Küsters, Max Tuengerthal
ICASSP
2009
IEEE
15 years 4 months ago
Distributed adaptive estimation of correlated node-specific signals in a fully connected sensor network
We introduce a distributed adaptive estimation algorithm operating in an ideal fully connected sensor network. The algorithm estimates node-specific signals at each node based on...
Alexander Bertrand, Marc Moonen
IEEEIAS
2009
IEEE
15 years 4 months ago
Detecting Insider Attacks Using Non-negative Matrix Factorization
—It is a fact that vast majority of attention is given to protecting against external threats, which are considered more dangerous. However, some industrial surveys have indicate...
Jan Platos, Václav Snásel, Pavel Kr&...
ASIACRYPT
2009
Springer
15 years 4 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
BPM
2009
Springer
168views Business» more  BPM 2009»
15 years 4 months ago
Divide-and-Conquer Strategies for Process Mining
The goal of Process Mining is to extract process models from logs of a system. Among the possible models to represent a process, Petri nets is an ideal candidate due to its graphic...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...