Sciweavers

2237 search results - page 103 / 448
» On the Security of Random Sources
Sort
View
DIMVA
2006
15 years 6 months ago
Using Type Qualifiers to Analyze Untrusted Integers and Detecting Security Flaws in C Programs
Incomplete or improper input validation is one of the major sources of security bugs in programs. While traditional approaches often focus on detecting string related buffer overfl...
Ebrima N. Ceesay, Jingmin Zhou, Michael Gertz, Kar...
169
Voted
FOCS
2000
IEEE
15 years 9 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
FSE
1997
Springer
119views Cryptology» more  FSE 1997»
15 years 9 months ago
Cryptanalysis of Ladder-DES
Feistel ciphers are very common and very important in the design and analysis of blockciphers, especially due to four reasons: (1) Many (DES-like) ciphers are based on Feistel’s ...
Eli Biham
IPTPS
2004
Springer
15 years 10 months ago
Secure Acknowledgment of Multicast Messages in Open Peer-to-Peer Networks
We propose a new cryptographic technique, Acknowledgment Compression, permitting senders of multicast data to verify that all interested parties have either received the data or l...
Antonio Nicolosi, David Mazières
MOBICOM
2003
ACM
15 years 10 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas