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...
Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H...
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
XML is here as the internet standard for information exchange among e-businesses and applications. With its dramatic adoption and its ability to model structured, unstructured and...
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
Mattias Andersson, Joachim Gudmundsson, Christos L...