129
click to vote
IACR
2011
14 years 4 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
138
click to vote
IACR
2011
14 years 4 months ago
2011
We analyze the internal permutations of Keccak, one of the NIST SHA-3 competition finalists, in regard to differential properties. By carefully studying the elements composing th...
173
click to vote
IACR
2011
14 years 4 months ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
157
click to vote
IACR
2011
14 years 4 months 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...
IACR
2011
14 years 4 months ago
2011
IACR
2011
14 years 4 months ago
2011
153
click to vote
IACR
2011
14 years 4 months 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 4 months ago
2011
IACR
2011
14 years 4 months ago
2011
147
click to vote
IACR
2011
14 years 4 months ago
2011
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...