Sciweavers

132 search results - page 26 / 27
» New and improved constructions of non-malleable cryptographi...
Sort
View
INFOCOM
2012
IEEE
11 years 8 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
PADS
2003
ACM
13 years 11 months ago
Parallel Network Simulation under Distributed Genesis
We describe two major developments in the General Network Simulation Integration System (Genesis): the support for BGP protocol in large network simulations and distribution of th...
Boleslaw K. Szymanski, Yu Liu, Rashim Gupta
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 9 days ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
PKC
2000
Springer
120views Cryptology» more  PKC 2000»
13 years 9 months ago
Optimally Efficient Accountable Time-Stamping
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
Ahto Buldas, Helger Lipmaa, Berry Schoenmakers
ESORICS
2009
Springer
14 years 6 months ago
Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing
Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, whe...
Qian Wang, Cong Wang, Jin Li, Kui Ren, Wenjing Lou