Sciweavers

429 search results - page 20 / 86
» Permutative Additives and Exponentials
Sort
View
ICPP
1992
IEEE
13 years 11 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 1 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
MFCS
2007
Springer
14 years 1 months ago
Minimizing Variants of Visibly Pushdown Automata
The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses of VPA are introduced: call driven automata, and block automata. For the first class, minim...
Patrick Chervet, Igor Walukiewicz
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 7 months ago
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources
We propose an information–theoretic approach to the watermark embedding and detection under limited detector resources. First, we present asymptotically optimal decision regions...
Neri Merhav, Erez Sabbag
TCC
2005
Springer
176views Cryptology» more  TCC 2005»
14 years 1 months ago
How to Securely Outsource Cryptographic Computations
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
Susan Hohenberger, Anna Lysyanskaya