2237 search results - page 68 / 448 » On the Security of Random Sources |
106
Voted
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Chosen-ciphertext security is by now a standard security property for asymmetric encryption. Many generic constructions for building secure cryptosystems from primitives with lower...
142
click to vote
ACISP
2009
Springer
15 years 9 months ago
2009
Springer
This paper describes a m-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than...
151
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
160
click to vote
ACNS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
144
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...