Sciweavers

4539 search results - page 97 / 908
» Approaches to Compute Workflow Complexity
Sort
View
FASE
2008
Springer
14 years 11 months ago
Automated Analysis of Permission-Based Security Using UMLsec
Abstract. To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems' resources. These permissions enf...
Jan Jürjens, Jörg Schreck, Yijun Yu
ASIACRYPT
2005
Springer
15 years 3 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov
PERCOM
2004
ACM
15 years 9 months ago
Models, Protocols, and Architectures for Secure Pervasive Computing: Challenges and Research Directions
We explore the challenges and research directions in building models, protocols and architectures to support security in pervasive computing environments. We argue that to be succ...
Roshan K. Thomas, Ravi S. Sandhu
GLOBECOM
2006
IEEE
15 years 4 months ago
Low-Complexity Adaptive High-Resolution Channel Prediction for OFDM Systems
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...
Ian C. Wong, Brian L. Evans
DEDS
2002
106views more  DEDS 2002»
14 years 9 months ago
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
Peter Buchholz, Peter Kemper