Sciweavers

95 search results - page 19 / 19
» The Complexity of Synchronous Notions of Information Flow Se...
Sort
View
CORR
2011
Springer
176views Education» more  CORR 2011»
12 years 11 months ago
Quantitative Synthesis for Concurrent Programs
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...
SACRYPT
2007
Springer
141views Cryptology» more  SACRYPT 2007»
13 years 10 months ago
Analysis of Countermeasures Against Access Driven Cache Attacks on AES
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
Johannes Blömer, Volker Krummel
VIZSEC
2005
Springer
13 years 10 months ago
Multiple Coordinated Views for Network Attack Graphs
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
Steven Noel, Michael Jacobs, Pramod Kalapa, Sushil...
DSN
2004
IEEE
13 years 8 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...
TCC
2007
Springer
86views Cryptology» more  TCC 2007»
13 years 10 months ago
Weakly-Private Secret Sharing Schemes
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
Amos Beimel, Matthew K. Franklin