Sciweavers

IACR
2011
149views more  IACR 2011»
14 years 6 months ago
Improved zero-sum distinguisher for full round Keccak-f permutation
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
Ming Duan, Xuejia Lai
192
Voted
IACR
2011
243views more  IACR 2011»
14 years 6 months ago
Guess-then-Meet-in-the-Middle Attacks on the KTANTAN Family of Block Ciphers
The block cipher family for lightweight devices, KTANTAN, is analyzed in this paper. We propose a new cryptanalysis method which improves results of Meet-in-the-Middle attacks on K...
Bo Zhu, Guang Gong
IACR
2011
80views more  IACR 2011»
14 years 6 months ago
History-Free Sequential Aggregate Signatures
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion o...
Marc Fischlin, Anja Lehmann, Dominique Schröd...
IACR
2011
127views more  IACR 2011»
14 years 6 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
IACR
2011
101views more  IACR 2011»
14 years 6 months ago
Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...
Emil Stefanov, Elaine Shi, Dawn Song