124
click to vote
IACR
2011
14 years 8 days ago
2011
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...
64
Voted
IACR
2011
14 years 8 days ago
2011
IACR
2011
14 years 8 days ago
2011
115
Voted
IACR
2011
14 years 8 days ago
2011
Abstract. Sophie Germain Counter Mode (SGCM) is an authenticated encryption mode of operation, to be used with 128-bit block ciphers such as AES. SGCM is a variant of the NIST stan...
IACR
2011
14 years 8 days ago
2011
113
Voted
IACR
2011
14 years 8 days ago
2011
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
115
Voted
IACR
2011
14 years 8 days ago
2011
What does it mean for an encryption scheme to be leakage-resilient? Prior formulations require that the scheme remains semantically secure even in the presence of leakage, but onl...
128
Voted
IACR
2011
14 years 8 days ago
2011
We put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage to...
104
click to vote
IACR
2011
14 years 8 days ago
2011
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...