Sciweavers

719 search results - page 130 / 144
» Proving Security Protocols Correct
Sort
View
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
85
Voted
TOPLAS
2010
101views more  TOPLAS 2010»
14 years 8 months ago
Nomadic pict: Programming languages, communication infrastructure overlays, and semantics for mobile computation
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
Peter Sewell, Pawel T. Wojciechowski, Asis Unyapot...
INFOCOM
2012
IEEE
13 years 1 days ago
Toward simple criteria to establish capacity scaling laws for wireless networks
Abstract—Capacity scaling laws offer fundamental understanding on the trend of user throughput behavior when the network size increases. Since the seminal work of Gupta and Kumar...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou,...
ESAS
2007
Springer
15 years 3 months ago
Authenticating DSR Using a Novel Multisignature Scheme Based on Cubic LFSR Sequences
The problem of secure routing in mobile ad hoc networks is long-standing and has been extensively studied by researchers. Recently, techniques of aggregating signatures have been a...
Saikat Chakrabarti 0002, Santosh Chandrasekhar, Mu...
DAGSTUHL
2006
14 years 11 months ago
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independent...
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madr...