Sciweavers

347 search results - page 28 / 70
» On private computation in incomplete networks
Sort
View
SPC
2005
Springer
14 years 1 months ago
Ephemeral Pairing on Anonymous Networks
The ephemeral pairing problem requires two or more specific physical nodes in a wireless broadcast network, that do not yet know each other, to establish a short-term relationship...
Jaap-Henk Hoepman
FOCS
2009
IEEE
14 years 2 months ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao
WISEC
2010
ACM
14 years 1 months ago
Privacy-preserving computation of benchmarks on item-level data using RFID
Currently, companies are about to optimize their internal processes by monitoring items they handle with Radio Frequency Identification (RFID). However, there is a risk that sens...
Florian Kerschbaum, Nina Oertel, Leonardo Weiss Fe...
MOBISYS
2007
ACM
14 years 7 months ago
Preserving location privacy in wireless lans
The broadcast and tetherless nature of wireless networks and the widespread deployment of Wi-Fi hotspots makes it easy to remotely locate a user by observing her wireless signals....
Tao Jiang, Helen J. Wang, Yih-Chun Hu
ICPADS
2005
IEEE
14 years 1 months ago
Separable and Anonymous Identity-Based Key Issuing
Abstract. In identity-based (ID-based) cryptosystems, a local registration authority (LRA) is responsible for authentication of users while the key generation center (KGC) is respo...
Ai Fen Sui, Sherman S. M. Chow, Lucas Chi Kwong Hu...