Sciweavers

Share
16 search results - page 1 / 4
» Separations of Non-monotonic Randomness Notions
Sort
View
CCA
2009
Springer
9 years 4 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
COMPGEOM
1997
ACM
9 years 2 months ago
Time-Series Similarity Problems and Well-Separated Geometric Sets
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
Béla Bollobás, Gautam Das, Dimitrios...
EUROCRYPT
2007
Springer
9 years 4 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
PKC
2015
Springer
17views Cryptology» more  PKC 2015»
3 years 6 months ago
Adaptive Proofs of Knowledge in the Random Oracle Model
We formalise the notion of adaptive proofs of knowledge in the random oracle model, where the extractor has to recover witnesses for multiple, possibly adaptively chosen statements...
David Bernhard, Marc Fischlin, Bogdan Warinschi
ENTCS
2007
174views more  ENTCS 2007»
8 years 10 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
books