Sciweavers

1497 search results - page 240 / 300
» A Computational Model for Message Passing
Sort
View
CJ
2006
100views more  CJ 2006»
13 years 8 months ago
Deterministic Identity-Based Signatures for Partial Aggregation
Aggregate signatures are a useful primitive which allows to aggregate into a single and constant-length signature many signatures on different messages computed by different users...
Javier Herranz
ACL
2010
13 years 6 months ago
An Exact A* Method for Deciphering Letter-Substitution Ciphers
Letter-substitution ciphers encode a document from a known or hypothesized language into an unknown writing system or an unknown encoding of a known writing system. It is a proble...
Eric Corlett, Gerald Penn
MOBIHOC
2010
ACM
13 years 5 months ago
Security-capacity trade-off in large wireless networks using keyless secrecy
We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n rando...
Sudarshan Vasudevan, Dennis Goeckel, Donald F. Tow...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 10 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
PERCOM
2007
ACM
14 years 7 months ago
Buddy tracking - efficient proximity detection among mobile friends
: Global positioning systems (GPS) and mobile phone networks are making it possible to track individual users with an increasing accuracy. It is natural to ask whether one can use ...
Arnon Amir, Alon Efrat, Jussi Myllymaki, Lingeshwa...