Sciweavers

661 search results - page 41 / 133
» Robustness Guarantees for Anonymity
Sort
View
91
Voted
ACSAC
2000
IEEE
15 years 1 months ago
Efficient Commerce Protocols based on One-Time Pads
We present a new commerce protocol that allows customers and merchants to conduct face-to-face creditcard authorizations with a credit card company securely with the option of ano...
Michael A. Schneider, Edward W. Felten
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
15 years 1 months ago
Preserving Privacy through Data Generation
Many databases will not or can not be disclosed without strong guarantees that no sensitive information can be extracted. To address this concern several data perturbation techniq...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
69
Voted
TISSEC
2010
72views more  TISSEC 2010»
14 years 7 months ago
Deterring voluntary trace disclosure in re-encryption mix-networks
An all too real threat to the privacy offered by a mix network is that individual mix administrators may volunteer partial tracing information to a coercer. While this threat can ...
XiaoFeng Wang, Philippe Golle, Markus Jakobsson, A...
BROADNETS
2007
IEEE
15 years 3 months ago
Joint monitoring and routing in wireless sensor networks using robust identifying codes
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...
Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, ...
96
Voted
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 4 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...