Sciweavers

4934 search results - page 789 / 987
» complexity 2008
Sort
View
CCS
2008
ACM
15 years 8 months ago
Robust, anonymous RFID authentication with constant key-lookup
A considerable number of anonymous RFID authentication schemes have been proposed. However, current proposals either do not provide robust security guarantees, or suffer from scal...
Mike Burmester, Breno de Medeiros, Rossana Motta
CCS
2008
ACM
15 years 8 months ago
Towards experimental evaluation of code obfuscation techniques
While many obfuscation schemes proposed, none of them satisfy any strong definition of obfuscation. Furthermore secure generalpurpose obfuscation algorithms have been proven to be...
Mariano Ceccato, Massimiliano Di Penta, Jasvir Nag...
CF
2008
ACM
15 years 8 months ago
Multi-terabit ip lookup using parallel bidirectional pipelines
To meet growing terabit link rates, highly parallel and scalable architectures are needed for IP lookup engines in next generation routers. This paper proposes an SRAM-based multi...
Weirong Jiang, Viktor K. Prasanna
CIKM
2008
Springer
15 years 8 months ago
Scaling up duplicate detection in graph data
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
Melanie Herschel, Felix Naumann
CIKM
2008
Springer
15 years 8 months ago
Information shared by many objects
If Kolmogorov complexity [25] measures information in one object and Information Distance [4, 23, 24, 42] measures information shared by two objects, how do we measure information...
Chong Long, Xiaoyan Zhu, Ming Li, Bin Ma