2237 search results - page 43 / 448 » On the Security of Random Sources |
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
ASIACRYPT
2000
Springer
15 years 2 months ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
CACM
2008
14 years 9 months ago
2008
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...