388 search results - page 8 / 78 » Quantum Lower Bounds by Polynomials |
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...
TAMC
2007
Springer
14 years 24 days ago
2007
Springer
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
IPL
2006
13 years 6 months ago
2006
At the heart of the Goldreich-Levin Theorem is the problem of determining an n-bit string a by making queries to two oracles, referred to as IP (inner product) and EQ (equivalence...
JC
2006
13 years 6 months ago
2006