Sciweavers

876 search results - page 33 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
GI
2009
Springer
13 years 8 months ago
Tracking of Extended Objects and Group Targets using Random Matrices - A Performance Analysis
: The task of tracking extended objects or (partly) unresolvable group targets raises new challenges for both data association and track maintenance. Due to limited sensor resoluti...
Michael Feldmann, Dietrich Fraenken
AFRICACRYPT
2010
Springer
14 years 5 months ago
Flexible Group Key Exchange with On-demand Computation of Subgroup Keys
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communica...
Michel Abdalla, Céline Chevalier, Mark Manu...
ACNS
2005
Springer
84views Cryptology» more  ACNS 2005»
14 years 4 months ago
Non-interactive Zero-Knowledge Arguments for Voting
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...
Jens Groth
INFOCOM
2009
IEEE
14 years 5 months ago
Lightweight Coloring and Desynchronization for Networks
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...
GECCO
2009
Springer
241views Optimization» more  GECCO 2009»
14 years 3 months ago
A fast high quality pseudo random number generator for nVidia CUDA
Previously either due to hardware GPU limits or older versions of software, careful implementation of PRNGs was required to make good use of the limited numerical precision availa...
William B. Langdon