Sciweavers

100 search results - page 9 / 20
» Asynchronous Secure Multiparty Computation in Constant Time
Sort
View
WPES
2004
ACM
14 years 2 months ago
Privacy preserving route planning
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
Keith B. Frikken, Mikhail J. Atallah
PODC
2004
ACM
14 years 2 months ago
Asynchronous group key exchange with failures
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Christian Cachin, Reto Strobl
FOCS
2009
IEEE
14 years 3 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
CSR
2009
Springer
14 years 3 months ago
A Feebly Secure Trapdoor Function
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
Edward A. Hirsch, Sergey I. Nikolenko
INFOCOM
2011
IEEE
13 years 9 days ago
Secure friend discovery in mobile social networks
– Mobile social networks extend social networks in the cyberspace into the real world by allowing mobile users to discover and interact with existing and potential friends who ha...
Wei Dong, Vacha Dave, Lili Qiu, Yin Zhang