Sciweavers

769 search results - page 83 / 154
» Where Is the Proof
Sort
View
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
14 years 3 months ago
Chernoff-Type Direct Product Theorems
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
FC
2005
Springer
142views Cryptology» more  FC 2005»
14 years 2 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
APPROX
2004
Springer
149views Algorithms» more  APPROX 2004»
14 years 2 months ago
Edge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
Noga Alon, Vera Asodi
ASIACRYPT
2006
Springer
14 years 20 days ago
On the Security of OAEP
Currently, the best and only evidence of the security of the OAEP encryption scheme is a proof in the contentious random oracle model. Here we give further arguments in support of...
Alexandra Boldyreva, Marc Fischlin
DAGSTUHL
2000
13 years 10 months ago
Similarity Measure Computation of Convex Polyhedra Revisited
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski's theory of mixed volumes. To compute the similarity measure, a (mix...
Jos B. T. M. Roerdink, Henk Bekker