1274 search results - page 31 / 255 » New Proofs for |
TOC
2010
13 years 2 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
ESOP
2005
Springer
14 years 1 months ago
2005
Springer
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. In this paper, we study the security proofs of GCM (Galois/Counter Mode of Operation). We first point out that a lemma, which is related to the upper bound on the probab...