Sciweavers

205

IACR
2011

106views more IACR 2011»

Hash Functions Based on Three Permutations: A Generic Security Analysis

14 years 6 months ago

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

claim paper

Read More »

112

click to vote

IACR
2011

83views more IACR 2011»

Outsourcing Multi-Party Computation

14 years 6 months ago

Download eprint.iacr.org

Seny Kamara, Payman Mohassel, Mariana Raykova

claim paper

Read More »

106

click to vote

IACR
2011

75views more IACR 2011»

Graceful Degradation in Multi-Party Computation

14 years 6 months ago

Download ftp.inf.ethz.ch

Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik...

claim paper

Read More »

197

click to vote

IACR
2011

139views more IACR 2011»

SGCM: The Sophie Germain Counter Mode

14 years 6 months ago

Download mjos.fi

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...

Markku-Juhani O. Saarinen

claim paper

Read More »

97

click to vote

IACR
2011

81views more IACR 2011»

From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again

14 years 6 months ago