Sciweavers

523 search results - page 24 / 105
» On the Power of Quantum Proofs
Sort
View
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
15 years 11 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
114
Voted
FSTTCS
2010
Springer
14 years 12 months ago
Lower bounds for Quantum Oblivious Transfer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...
André Chailloux, Iordanis Kerenidis, Jamie ...
WSC
1998
15 years 3 months ago
Windows-based Animation with PROOF
Proof AnimationTM is a family of products for animating discrete event simulations. Proof is available in a variety of versions, including an inexpensive, student version, midsize...
James O. Henriksen
WSC
1989
15 years 3 months ago
A general purpose animator
Proof Animation™ is a family of products for animating discrete event simulations. Proof is available in a variety of versions, including an inexpensive, student version, midsiz...
Daniel T. Brunner, James O. Henriksen
ENTCS
2006
143views more  ENTCS 2006»
15 years 1 months ago
Hiproofs: A Hierarchical Notion of Proof Tree
Motivated by the concerns of theorem-proving, we generalise the notion of proof tree to that of hierarchical proof tree. Hierarchical trees extend ordinary trees by adding partial...
Ewen Denney, John Power, Konstantinos Tourlas