Sciweavers

2778 search results - page 62 / 556
» Limit complexities revisited
Sort
View
CCS
2007
ACM
15 years 6 months ago
Security under key-dependent inputs
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
Shai Halevi, Hugo Krawczyk
WEBDB
2007
Springer
159views Database» more  WEBDB 2007»
15 years 6 months ago
A clustering-based sampling approach for refreshing search engine's database
Due to resource constraints, search engines usually have difficulties keeping the local database completely synchronized with the Web. To detect as many changes as possible, the ...
Qingzhao Tan, Ziming Zhuang, Prasenjit Mitra, C. L...
SIGIR
2005
ACM
15 years 5 months ago
Information retrieval system evaluation: effort, sensitivity, and reliability
The effectiveness of information retrieval systems is measured by comparing performance on a common set of queries and documents. Significance tests are often used to evaluate the...
Mark Sanderson, Justin Zobel
FC
2005
Springer
171views Cryptology» more  FC 2005»
15 years 5 months ago
Identity-Based Partial Message Recovery Signatures (or How to Shorten ID-Based Signatures)
Abstract. We firstly proposed a new notion of short identity-based signature scheme. We argue that the identity-based environment is essential in some scenarios. The notion of sho...
Fangguo Zhang, Willy Susilo, Yi Mu
CF
2004
ACM
15 years 5 months ago
BLOB computing
Current processor and multiprocessor architectures are almost all based on the Von Neumann paradigm. Based on this paradigm, one can build a general-purpose computer using very fe...
Frédéric Gruau, Yves Lhuillier, Phil...