Sciweavers

3902 search results - page 618 / 781
» Hardware Synthesis from C C Models
Sort
View
ASIACRYPT
2005
Springer
16 years 2 days ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
EMSOFT
2005
Springer
16 years 1 days ago
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
PCI
2005
Springer
16 years 4 hour ago
Workflow Based Security Incident Management
Security incident management is one of the critical areas that offers valuable information to security experts, but still lacks much development. Currently, several security incide...
Meletis A. Belsis, Alkis Simitsis, Stefanos Gritza...
WAC
2005
Springer
137views Communications» more  WAC 2005»
15 years 12 months ago
Towards Self-optimizing Protocol Stack for Autonomic Communication: Initial Experience
Abstract. The Internet is facing ever-increasing complexity in the construction, configuration and management of heterogeneous networks. New communication paradigms are underminin...
Xiaoyuan Gu, Xiaoming Fu, Hannes Tschofenig, Lars ...
DIALM
2004
ACM
165views Algorithms» more  DIALM 2004»
15 years 12 months ago
LLS: a locality aware location service for mobile ad hoc networks
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
Ittai Abraham, Danny Dolev, Dahlia Malkhi