Sciweavers

124 search results - page 3 / 25
» Randomly supported independence and resistance
Sort
View
CORR
2006
Springer
206views Education» more  CORR 2006»
13 years 5 months ago
ANAP: Anonymous Authentication Protocol in Mobile Ad hoc Networks
The pervasiveness of wireless communication recently gave mobile ad hoc networks (MANET) a significant researcher's attention, due to its innate capabilities of instant commu...
Tomasz Ciszkowski, Zbigniew Kotulski
SACRYPT
2005
Springer
13 years 11 months ago
Proving the Security of AES Substitution-Permutation Network
In this paper we study the substitution-permutation network (SPN) on which AES is based. We introduce AES∗ , a SPN identical to AES except that fixed S-boxes are replaced by ran...
Thomas Baignères, Serge Vaudenay
ECCC
2011
282views ECommerce» more  ECCC 2011»
13 years 5 days ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
TCSV
2008
134views more  TCSV 2008»
13 years 5 months ago
Invariant Image Watermarking Based on Statistical Features in the Low-Frequency Domain
Watermark resistance to geometric attacks is an important issue in the image watermarking community. Most countermeasures proposed in the literature usually focus on the problem of...
Shijun Xiang, Hyoung-Joong Kim, Jiwu Huang
FOCS
1999
IEEE
13 years 10 months ago
An Algorithmic Theory of Learning: Robust Concepts and Random Projection
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
Rosa I. Arriaga, Santosh Vempala