622 search results - page 1 / 125 » Fast Computation of Large Distributions and Its Cryptographi... |
ASIACRYPT
2005
Springer
14 years 4 months ago
2005
Springer
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
EUROCRYPT
2005
Springer
14 years 4 months ago
2005
Springer
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
ECCV
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We present a novel algorithm for approximating the parameters of a multivariate t-distribution. At the expense of a slightly decreased accuracy in the estimates, the prop...
IPPS
2000
IEEE
14 years 3 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
CCIA
2009
Springer
14 years 1 hour ago
2009
Springer
Meeting Scheduling is a suitable application for distributed computation, motivated by its privacy requirements. Previous work on this problem have considered some cryptographic te...