198 search results - page 38 / 40 » The Multiplicative Quantum Adversary |
102
Voted
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
88
Voted
ACISP
2009
Springer
15 years 6 months ago
2009
Springer
In the setting of identity-based encryption with multiple trusted authorities, TA anonymity formally models the inability of an adversary to distinguish two ciphertexts correspondi...
114
Voted
EUROCRYPT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
101
click to vote
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— While earlier studies have pointed out that short-lived TCP flows (mice) may hurt long-lived TCP flows (elephants) in the long term, they provide insufficient insight for devel...
ISPAN
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper we present a general methodology for designing supervised peer-to-peer systems. A supervised peer-to-peer system is a system in which the overlay network is formed b...