374 search results - page 34 / 75 » On Communicating Automata with Bounded Channels |
148
click to vote
SECRYPT
2008
15 years 7 months ago
2008
Distance-bounding protocols have been proposed by Brands and Chaum in 1993 in order to detect relay attacks, also known as mafia fraud. Although the idea has been introduced fiftee...
160
Voted
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
156
click to vote
FUIN
2006
15 years 6 months ago
2006
Abstract. We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of ...
177
click to vote
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
—This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques ...
163
Voted
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
The RAIN (Reliable Array of Independent Nodes) project at Caltech is focusing on creating highly reliable distributed systems by leveraging commercially available personal compute...