Sciweavers

147 search results - page 21 / 30
» A Distributed and Oblivious Heap
Sort
View
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 7 months ago
Network Codes Resilient to Jamming and Eavesdropping
Abstract--We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious err...
Hongyi Yao, Danilo Silva, Sidharth Jaggi, Michael ...
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 5 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
IPPS
2010
IEEE
13 years 5 months ago
MMT: Exploiting fine-grained parallelism in dynamic memory management
Dynamic memory management is one of the most expensive but ubiquitous operations in many C/C++ applications. Additional features such as security checks, while desirable, further w...
Devesh Tiwari, Sanghoon Lee, James Tuck, Yan Solih...
CCS
2009
ACM
14 years 8 months ago
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...
Kannan Srinathan, Arpita Patra, Ashish Choudhary, ...
ICDCS
2009
IEEE
14 years 5 months ago
CAP: A Context-Aware Privacy Protection System for Location-Based Services
We address issues related to privacy protection in location-based services (LBS). Most existing research in this field either requires a trusted third-party (anonymizer) or uses ...
Aniket Pingley, Wei Yu, Nan Zhang 0004, Xinwen Fu,...