Sciweavers

4192 search results - page 82 / 839
» Efficient testing of groups
Sort
View
JCO
2007
56views more  JCO 2007»
13 years 10 months ago
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
H. B. Chen, Ding-Zhu Du, Frank K. Hwang
FOCS
2004
IEEE
14 years 2 months ago
Testing Low-Degree Polynomials over Prime Fields
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra...
ENVSOFT
2007
80views more  ENVSOFT 2007»
13 years 10 months ago
Testing the PEARL model in the Netherlands and Sweden
The Plant Protection Product Directive (91/414/EEC) stresses the need of validated models to calculate predicted environmental concentrations. The use of models has become an unav...
Fayçal Bouraoui
EUROCRYPT
2004
Springer
14 years 2 months ago
Anonymous Identification in Ad Hoc Groups
We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...
Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi,...
IJNSEC
2008
124views more  IJNSEC 2008»
13 years 10 months ago
Scalable Delay-constrained Multicast Group Key Management
In the last few years, multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet. Some multicast applications requi...
Said Gharout, Yacine Challal, Abdelmadjid Bouabdal...