Sciweavers

80 search results - page 8 / 16
» Attacking and fixing PKCS
Sort
View
CCS
2010
ACM
13 years 11 months ago
Symbolic security analysis of ruby-on-rails web applications
Many of today's web applications are built on frameworks that include sophisticated defenses against malicious adversaries. However, mistakes in the way developers deploy tho...
Avik Chaudhuri, Jeffrey S. Foster
IEEEARES
2006
IEEE
14 years 4 months ago
Evaluation of Network Robustness for Given Defense Resource Allocation Strategies
Since the 9/11 terrorist attacks, the effective and efficient protection of critical information infrastructures has become an even more important issue. To enhance network surviv...
Y.-S. Lin, P.-H. Tsang, C.-H. Chen, C.-L. Tseng, Y...
CODCRY
2011
Springer
242views Cryptology» more  CODCRY 2011»
13 years 2 months ago
Faster 2-Regular Information-Set Decoding
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
IJNSEC
2008
110views more  IJNSEC 2008»
13 years 11 months ago
Security Measures and Weaknesses of the GPRS Security Architecture
This paper presents an evaluation of the security architecture employed in the General Packet Radio Services (GPRS). More specifically, the security measures applied to protect th...
Christos Xenakis
IPL
2010
134views more  IPL 2010»
13 years 5 months ago
Parameterized algorithm for eternal vertex cover
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, D...