Sciweavers

1235 search results - page 239 / 247
» Formalizing information security knowledge
Sort
View
EUROCRYPT
2001
Springer
14 years 3 days ago
Cryptographic Counters and Applications to Electronic Voting
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value pri...
Jonathan Katz, Steven Myers, Rafail Ostrovsky
CIE
2007
Springer
13 years 11 months ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...
DSN
2004
IEEE
13 years 11 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 7 months ago
Distributed Storage Codes Meet Multiple-Access Wiretap Channels
We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
COMCOM
2006
121views more  COMCOM 2006»
13 years 7 months ago
Interactive Transparent Networking: Protocol meta modeling based on EFSM
the extensibility and evolution of network services and protocols had become a major research issue in recent years. The 'programmable' and 'active' network par...
Javed I. Khan, Raid Zaghal