ASIACRYPT
2015
Springer
8 years 7 months ago
2015
Springer
We study the adaptive security of constrained PRFs in the standard model. We initiate our exploration with puncturable PRFs. A puncturable PRF family is a special class of constra...
ASIACRYPT
2015
Springer
8 years 7 months ago
2015
Springer
In this work, we study the intrinsic complexity of black-box Universally Composable (UC) secure computation based on general assumptions. We present a thorough study in various co...
ASIACRYPT
2015
Springer
8 years 7 months ago
2015
Springer
Abstract. We describe three contributions regarding the Soft Analytical Side-Channel Attacks (SASCA) introduced at Asiacrypt 2014. First, we compare them with Algebraic Side-Channe...
ASIACRYPT
2015
Springer
8 years 7 months ago
2015
Springer
The security of pairing-based crypto-systems relies on the difficulty to compute discrete logarithms in finite fields Fpn where n is
ASIACRYPT
2015
Springer
8 years 7 months ago
2015
Springer
We extend the reach of functional encryption schemes that are provably secure under simple assumptions against unbounded collusion to include function-hiding inner product schemes...
ASIACRYPT
2015
Springer
8 years 7 months ago
2015
Springer
LowMC is a collection of block cipher families introduced at Eurocrypt 2015 by Albrecht et al. Its design is optimized for instantiations of multi-party computation, fully homomorp...
ASIACRYPT
2015
Springer
8 years 7 months ago
2015
Springer
Abstract. We assume a scenario where an attacker can mount several independent attacks on a single CPU. Each attack can be run several times in independent ways. Each attack can su...
ASIACRYPT
2015
Springer
8 years 7 months ago
2015
Springer
The ASASA construction is a new design scheme introduced at Asiacrypt 2014 by Biryukov, Bouillaguet and Khovratovich. Its versatility was illustrated by building two public-key enc...
ASIACRYPT
2015
Springer
8 years 7 months ago
2015
Springer
Abstract. Hash functions are often constructed based on permutations or blockciphers, and security proofs are typically done in the ideal permutation or cipher model. However, once...
ASIACRYPT
2015
Springer
8 years 7 months ago
2015
Springer
The iterated Even-Mansour construction defines a block cipher from a tuple of public n-bit permutations (P1, . . . , Pr) by alternatively xoring some n-bit round key ki, i = 0, . ...