198 search results - page 6 / 40 » The Multiplicative Quantum Adversary |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
SPAA
2003
ACM
14 years 24 days ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...