Sciweavers

4850 search results - page 894 / 970
» Proof and Computation in Geometry
Sort
View
WIOPT
2005
IEEE
15 years 6 months ago
Secure Comparison of Encrypted Data in Wireless Sensor Networks
End-to-end encryption schemes that support operations over ciphertext are of utmost importance for commercial private party Wireless Sensor Network implementations to become meani...
Mithun Acharya, Joao Girão, Dirk Westhoff
116
Voted
SPAA
2005
ACM
15 years 6 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
15 years 6 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
ASIACRYPT
2004
Springer
15 years 6 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
136
Voted
FOCS
2003
IEEE
15 years 5 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...