*06:17* [Pub][ePrint]
3D Hardware Canaries, by Sébastien Briais and Stéphane Caron and Jean-Michel Cioranesco and Jean-Luc Danger and Sylvain Guilley and Jacques-Henri Jourdan and Arthur Milchior and David Naccache and T
3D integration is a promising advanced manufacturing process offering a variety of new hardware security protection opportunities. This paper presents a way of securing 3D ICs using Hamiltonian paths as hardware integrity verification sensors. As 3D integration consists in the stacking of many metal layers, one can consider surrounding a security-sensitive circuit part by a wire cage.After exploring and comparing different cage construction strategies (and reporting preliminary implementation results on silicon), we introduce a \"hardware canary\". The canary is a spatially distributed chain of functions $F_i$ positioned at the vertices of a 3D cage surrounding a protected circuit. A correct answer $(F_n \\circ \\ldots \\circ F_1)(m)$ to a challenge $m$ attests the canary\'s integrity.

*06:17* [Pub][ePrint]
A note on generalized bent criteria for Boolean functions, by Sugata Gangopadhyay, Enes Pasalic and Pantelimon Stanica
In this paper, we consider the spectra of Boolean functionswith respect to the action of unitary transforms obtained by

taking tensor products of the Hadamard, denoted by $H$, and the

nega--Hadamard, denoted by $N$,

kernels. The set of all such transforms is denoted by $\\{H, N\\}^n$.

A Boolean function is said to be bent$_4$ if its spectrum

with respect to at least one unitary transform in $\\{H, N\\}^n$ is flat.

We prove that the maximum possible algebraic degree of a bent$_4$

function on $n$ variables is $\\lceil \\frac{n}{2} \\rceil$, and hence

solve an open problem posed by Riera and Parker [cf. IEEE-IT: 52(2)(2006) 4142--4159].

We obtain a relationship between bent and bent$_4$ functions which is

a generalization of the relationship between bent and negabent Boolean

functions proved by Parker and Pott [cf. LNCS: 4893(2007) 9--23].

*06:17* [Pub][ePrint]
The Multivariate Probabilistic Encryption Scheme MQQ-ENC, by Danilo Gligoroski and Simona Samardjiska
We propose a new multivariate probabilistic encryption scheme with decryption errors MQQ-ENC that belongs to the family of MQQ-based public key schemes. Similarly to MQQ-SIG, the trapdoor is constructed using quasigroup string transformations with multivariate quadratic quasigroups, and a minus modifier with relatively small and fixed number of removed equations. To make the decryption possible and also efficient, we use a universal hash function to eliminate possibly wrong plaintext candidates. We show that, in this way, the probability of erroneous decryption becomes negligible. MQQ-ENC is defined over the fields $\\mathbb{F}_{2^k}$ for any $k \\geq 1$, and can easily be extended to any $\\mathbb{F}_{p^k}$, for prime $p$. One important difference from MQQ-SIG is that in MQQ-ENC we use left MQQs (LMQQs) instead of bilinear MQQs. Our choice can be justified by our extensive experimental analysis that showed the superiority of the LMQQs over the bilinear MQQs for the design of MQQ-ENC.

We apply the standard cryptanalytic techniques on MQQ-ENC, and from the results, we pose a plausible conjecture that the instances of the MQQ-ENC trapdoor are hard instances with respect to the MQ problem. Under this assumption, we adapt the Kobara-Imai conversion of the McEliece scheme for MQQ-ENC and prove that it provides $\\mathsf{IND-CCA}$ security despite the negligible probability of decryption errors.

We also recommend concrete parameters for MQQ-ENC for encryption of blocks of 128 bits for a security level of $\\mathcal{O}(2^{128})$.

*06:17* [Pub][ePrint]
An Analysis of ZVP-Attack on ECC Cryptosystems, by Claude Crépeau and Raza Ali Kazmi
Elliptic curve cryptography (ECC) is an efficient public cryptosystem witha short key size. For this reason it is suitable for implementing on memory-constraint

devices such as smart cards, mobile devices, etc. However, these devices leak information

about their private key through side channels (power consumption, electromagnetic

radiation, timing etc) during cryptographic processing. In this paper we have examined

countermeasures against a specific class of side channel attacks (power analysis) called

Zero-Value Point Attack (ZVP), using elliptic curve isomorphism and isogeny. We found

that these methods are an efficient way of securing cryptographic devices using ECC

against ZVP attack. Our main contribution is to extend the work of Akishita and Takagi

[3,2] to binary fields. We also provide a more detail analysis of the ZVP attack over

prime fields.

*06:17* [Pub][ePrint]
Homomorphic A-codes for Network Coding, by Zhaohui Tang
Authentication codes (A-codes) are a well studied technique to provide unconditionally secureauthentication. An A-code is defined by a map that associates a pair formed by a message and a key

to a tag. A-codes linear in the keys have been studied for application to distributed authentication

schemes. In this paper, we address the dual question, namely the study of A-codes that are linear in the

messages. This is usually an undesired property, except in the context of network coding. Regarding

these A-codes, we derive some lower bounds on security parameters when key space is known. We

also show a lower bound on key size when security parameter values are given (with some special

properties) and construct some codes meeting the bound.