Sciweavers

851 search results - page 124 / 171
» Random constructions and density results
Sort
View
EUROCRYPT
2009
Springer
15 years 10 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
MFCS
2009
Springer
15 years 2 months ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...
MOBICOM
2003
ACM
15 years 3 months ago
Towards realistic mobility models for mobile ad hoc networks
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin...
MOBIHOC
2007
ACM
15 years 9 months ago
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
Michele Garetto, Paolo Giaccone, Emilio Leonardi
MOBIHOC
2002
ACM
15 years 9 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter