Sciweavers

2237 search results - page 32 / 448
» On the Security of Random Sources
Sort
View
DCC
2005
IEEE
14 years 11 months ago
On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
Shengtian Yang, Peiliang Qiu
ESANN
2004
14 years 11 months ago
Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
Fabian J. Theis, Pando G. Georgiev, Andrzej Cichoc...
IVIC
2009
Springer
15 years 4 months ago
Secure Minutiae-Based Fingerprint Templates Using Random Triangle Hashing
Abstract. Due to privacy concern on the widespread use of biometric authentication systems, biometric template protection has gained great attention in the biometric research recen...
Zhe Jin, Andrew Beng Jin Teoh, Thian Song Ong, Con...
VOTEID
2007
Springer
15 years 3 months ago
Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator
It is debatable if current direct-recording electronic voting machines can sufficiently be trusted for a use in elections. Reports about malfunctions and possible ways of manipulat...
Jens-Matthias Bohli, Jörn Müller-Quade, ...
95
Voted
GI
2003
Springer
15 years 2 months ago
Byzantine Failures and Security: Arbitrary is not (always) Random
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...
Felix C. Gärtner