Sciweavers

1302 search results - page 89 / 261
» On the Strong Chromatic Number
Sort
View
SIGMOD
2008
ACM
189views Database» more  SIGMOD 2008»
16 years 6 months ago
Dynamic anonymization: accurate statistical analysis with privacy preservation
A statistical database (StatDB) retrieves only aggregate results, as opposed to individual tuples. This paper investigates the construction of a privacy preserving StatDB that can...
Xiaokui Xiao, Yufei Tao
PERCOM
2008
ACM
16 years 6 months ago
Towards Robust Low Cost Authentication for Pervasive Devices
Low cost devices such as RFIDs, sensor network nodes, and smartcards are crucial for building the next generation pervasive and ubiquitous networks. The inherent power and footpri...
Erdinç Öztürk, Ghaith Hammouri, B...
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
16 years 1 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
COST
2009
Springer
184views Multimedia» more  COST 2009»
16 years 1 months ago
Cross-Layer Optimization Issues for Realizing Transparent Mesh Optical Networks
In transparent optical networks as the signal propagates through a transparent network it experiences the impact of a variety of quality degrading phenomena that are introduced by ...
Siamak Azodolmolky, Tibor Cinkler, Dimitrios Kloni...
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
16 years 18 days ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye