Sciweavers

1923 search results - page 51 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
ICDCIT
2004
Springer
15 years 3 months ago
Vulnerabilities and Threats in Distributed Systems
We discuss research issues and models for vulnerabilities and threats in distributed computing systems. We present four diverse approaches to reducing system vulnerabilities and th...
Bharat K. Bhargava, Leszek Lilien
AMC
2007
114views more  AMC 2007»
14 years 9 months ago
Software complexity: A statistical case study through insertion sort
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
Anchala Kumari, Soubhik Chakraborty
IPPS
2005
IEEE
15 years 3 months ago
Provider-Based Deterministic Packet Marking against Distributed DoS Attacks
One of the most serious security threats in the Internet are Distributed Denial of Service ( DDoS) attacks, due to the significant service disruption they can create and the diļ¬...
Vasilios A. Siris, Ilias Stavrakis
ENTCS
2007
104views more  ENTCS 2007»
14 years 9 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...