458 search results - page 32 / 92 » Perfect Skolem sets |
129
click to vote
TCC
2007
Springer
15 years 10 months ago
2007
Springer
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
101
click to vote
SOFSEM
2004
Springer
15 years 10 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
149
click to vote
WADS
1997
Springer
15 years 8 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
140
Voted
SEC
2001
15 years 6 months ago
2001
: The Cliques protocols are extensions of the Diffie-Hellman key exchange protocol to a group setting. In this paper, we are analysing the A-GDH.2 suite that is intended to allow a...
145
Voted
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Consider a scenario where a distributed signal is sparse and is acquired by various sensors that see different versions. Thus, we have a set of sparse signals with both some commo...