Sciweavers

2 search results - page 1 / 1
» Cube Attacks on Tweakable Black Box Polynomials
Sort
View
EUROCRYPT
2009
Springer
14 years 5 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
CRYPTO
2010
Springer
162views Cryptology» more  CRYPTO 2010»
13 years 4 months ago
On Strong Simulation and Composable Point Obfuscation
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...
Nir Bitansky, Ran Canetti