Sciweavers

26 search results - page 5 / 6
» crypto 2011
Sort
View
IACR
2011
92views more  IACR 2011»
12 years 7 months ago
From Non-Adaptive to Adaptive Pseudorandom Functions
Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i....
Iftach Haitner, Itay Berman
IACR
2011
127views more  IACR 2011»
12 years 7 months ago
Cryptanalysis of KeeLoq code-hopping using a Single FPGA
The KeeLoq cipher is used in many wireless car door systems and garage openers. Recently the algorithm was studied and several attacks have been published. When a random seed is no...
Idan Sheetrit, Avishai Wool
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
12 years 7 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
IACR
2011
104views more  IACR 2011»
12 years 7 months ago
Collusion Resistant Obfuscation and Functional Re-encryption
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...
Nishanth Chandran, Melissa Chase, Vinod Vaikuntana...
IACR
2011
106views more  IACR 2011»
12 years 7 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel