Sciweavers

1656 search results - page 245 / 332
» Secure Computation Without Authentication
Sort
View
KIVS
2005
Springer
14 years 2 months ago
Exploiting Regular Hot-Spots for Drive-thru Internet
Abstract. IEEE 802.11 WLAN technology has become an inexpensive, yet powerful access technology that is targeted at mobile users that remain within reach of the hot-spot. Such hot-...
Jörg Ott, Dirk Kutscher
DSN
2006
IEEE
14 years 18 days ago
Lucky Read/Write Access to Robust Atomic Storage
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchr...
Rachid Guerraoui, Ron R. Levy, Marko Vukolic
PODC
2011
ACM
12 years 11 months ago
The complexity of robust atomic storage
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...
CRYPTO
2010
Springer
201views Cryptology» more  CRYPTO 2010»
13 years 10 months ago
Protecting Cryptographic Keys against Continual Leakage
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...
Ali Juma, Yevgeniy Vahlis
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 9 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff