Sciweavers

1923 search results - page 104 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CL
2007
Springer
14 years 9 months ago
A bulk-synchronous parallel process algebra
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
Armelle Merlin, Gaétan Hains
GD
2008
Springer
14 years 11 months ago
Graph Drawing for Security Visualization
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
Roberto Tamassia, Bernardo Palazzi, Charalampos Pa...
EDCC
2005
Springer
15 years 3 months ago
Gracefully Degrading Fair Exchange with Security Modules
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security mo...
Gildas Avoine, Felix C. Gärtner, Rachid Guerr...
HPCA
2009
IEEE
15 years 10 months ago
Hardware-software integrated approaches to defend against software cache-based side channel attacks
Software cache-based side channel attacks present serious threats to modern computer systems. Using caches as a side channel, these attacks are able to derive secret keys used in ...
Jingfei Kong, Onur Aciiçmez, Jean-Pierre Se...
CORR
2010
Springer
119views Education» more  CORR 2010»
14 years 4 months ago
Effective complexity of stationary process realizations
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by m...
Nihat Ay, Markus Müller, Arleta Szkola