Sciweavers

1019 search results - page 31 / 204
» Cryptographic Design Vulnerabilities
Sort
View
GI
2005
Springer
15 years 3 months ago
Security Extensions to MMARP Through Cryptographically Generated Addresses
: The MMARP protocol provides multicast routing in hybrid environments in which an ad hoc network is connected to the Internet. As many other routing protocols it was initially des...
Francisco J. Galera, Pedro M. Ruiz, Antonio F. G&o...
CANS
2009
Springer
126views Cryptology» more  CANS 2009»
15 years 4 months ago
Ensuring Authentication of Digital Information Using Cryptographic Accumulators
In this paper, we study the broadcast authentication problem for both erasure and adversarial networks. Two important concerns for authentication protocols are the authentication ...
Christophe Tartary
USENIX
2003
14 years 11 months ago
NCryptfs: A Secure and Convenient Cryptographic File System
Often, increased security comes at the expense of user convenience, performance, or compatibility with other systems. The right level of security depends on specific site and use...
Charles P. Wright, Michael C. Martino, Erez Zadok
ICST
2009
IEEE
15 years 4 months ago
Predicting Attack-prone Components
GEGICK, MICHAEL CHARLES. Predicting Attack-prone Components with Source Code Static Analyzers. (Under the direction of Laurie Williams). No single vulnerability detection techniqu...
Michael Gegick, Pete Rotella, Laurie A. Williams
ICALP
2005
Springer
15 years 3 months ago
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
Marius Zimand