5377 search results - page 877 / 1076 » Programming Languages For Interactive Computing |
146
click to vote
ICALP
2005
Springer
16 years 12 hour ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
162
click to vote
ICALP
2005
Springer
16 years 12 hour ago
2005
Springer
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
164
click to vote
ICALP
2005
Springer
16 years 12 hour ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
182
click to vote
ICALP
2005
Springer
16 years 12 hour ago
2005
Springer
We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the si...
159
click to vote
ICALP
2005
Springer
16 years 12 hour ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...