70 search results - page 6 / 14 » An Improved Security Bound for HCTR |
ICITS
2009
14 years 9 months ago
2009
Abstract. The term indistinguishability amplification refers to a setting where a certain construction combines two (or more) cryptographic primitives of the same type to improve t...
TCC
2012
Springer
13 years 7 months ago
2012
Springer
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
JCO
2007
14 years 11 months ago
2007
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
147
click to vote
CRYPTO
2003
Springer
15 years 5 months ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
HICSS
2006
IEEE
15 years 5 months ago
2006
IEEE
Secure multicast has a variety of applications in ecommerce, e-banking, command and control, video-ondemand, and other internet-based services. In this paper, we present algorithm...