2237 search results - page 145 / 448 » On the Security of Random Sources |
176
Voted
IACR
2011
14 years 5 months ago
2011
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
140
Voted
APPROX
2007
Springer
16 years 10 days ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
163
click to vote
TRUSTBUS
2004
Springer
15 years 11 months ago
2004
Springer
This paper addresses the problem of pay-as-you-watch services over unicast and multicast communications. For each communication model, we present two solutions, non-verifiable and...
158
Voted
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
165
click to vote
IEEEARES
2010
IEEE
15 years 10 months ago
2010
IEEE
Many software security vulnerabilities only reveal themselves under certain conditions, i.e., particular configurations of the software together with its particular runtime environ...