Sciweavers

7 search results - page 1 / 2
» Comparisons of K-Anonymization and Randomization Schemes und...
Sort
View
ICDM
2006
IEEE
93views Data Mining» more  ICDM 2006»
13 years 11 months ago
Comparisons of K-Anonymization and Randomization Schemes under Linking Attacks
Recently K-anonymity has gained popularity as a privacy quantification against linking attacks, in which attackers try to identify a record with values of some identifying attrib...
Zhouxuan Teng, Wenliang Du
INDOCRYPT
2005
Springer
13 years 10 months ago
Short Undeniable Signatures Without Random Oracles: The Missing Link
Abstract. We introduce a new undeniable signature scheme which is existentially unforgeable and anonymous under chosen message attacks in the standard model. The scheme is an embed...
Fabien Laguillaumie, Damien Vergnaud
ISCC
2009
IEEE
177views Communications» more  ISCC 2009»
13 years 11 months ago
SECLOUD: Source and Destination Seclusion Using Clouds for wireless ad hoc networks
—The privacy of communicating entities in wireless ad hoc networks is extremely important due to the potential of their being identified and subsequently subjected to attacks (e...
Razvi Doomun, Thaier Hayajneh, Prashant Krishnamur...
ICC
2008
IEEE
106views Communications» more  ICC 2008»
13 years 11 months ago
Lightweight Security for Network Coding
Abstract—Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different dat...
João P. Vilela, Luísa Lima, Jo&atild...
MOBICOM
2009
ACM
13 years 11 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang