Sciweavers

2237 search results - page 99 / 448
» On the Security of Random Sources
Sort
View
EUROCRYPT
2012
Springer
13 years 7 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
TIT
2011
112views more  TIT 2011»
14 years 12 months ago
On the Secure Degrees of Freedom of Relaying With Half-Duplex Feedback
—Secure communication protocols over a single-relay system in the presence of a multiple-antenna eavesdropper are investigated. When there is no direct link between the source an...
Thanh Tùng Kim, H. Vincent Poor
ICA
2007
Springer
15 years 11 months ago
ICA in Boolean XOR Mixtures
We consider Independent Component Analysis (ICA) for the case of binary sources, where addition has the meaning of the boolean “Exclusive Or” (XOR) operation. Thus, each mixtur...
Arie Yeredor
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
16 years 5 months ago
Using randomized response techniques for privacy-preserving data mining
Privacy is an important issue in data mining and knowledge discovery. In this paper, we propose to use the randomized response techniques to conduct the data mining computation. S...
Wenliang Du, Zhijun Zhan
138
Voted
IJSN
2006
96views more  IJSN 2006»
15 years 5 months ago
A new signature scheme without random oracles
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new ...
Chik How Tan