# Dario Catalano's research while affiliated with University of Catania and other places

## Publications (12)

Article
A double-authentication preventing signature (DAPS) scheme is a digital signature scheme equipped with a self-enforcement mechanism. Messages consist of an address and a payload component, and a signer is penalized if she signs two messages with the same addresses but different payloads. The penalty is the disclosure of the signer’s signing key. Mo...
Chapter
We construct new functional encryption schemes that combine the access control functionality of attribute-based encryption with the possibility of performing linear operations on the encrypted data. While such a primitive could be easily realized from fully fledged functional encryption schemes, what makes our result interesting is the fact that ou...
Chapter
A double-authentication preventing signature (DAPS) scheme is a digital signature scheme equipped with a self-enforcement mechanism. Messages consist of an address and a payload component, and a signer is penalized if she signs two messages with the same addresses but different payloads. The penalty is the disclosure of the signer’s signing key. Mo...
Chapter
ECDSA is a widely adopted digital signature standard. Unfortunately, efficient distributed variants of this primitive are notoriously hard to achieve and known solutions often require expensive zero knowledge proofs to deal with malicious adversaries. For the two party case, Lindell [Lin17] recently managed to get an efficient solution which, to ac...
Chapter
We construct functional encryption (FE) schemes for the orthogonality (OFE) relation where each ciphertext encrypts some vector and each decryption key, associated to some vector , allows to determine if is orthogonal to or not. Motivated by compelling applications, we aim at schemes which are function hidding, i.e. is not leaked. Our main contribu...
Article
Full-text available
We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts Programmable hash functions, introduced by Hofheinz and Kiltz (Crypto 2008, Springer, 2008), with two main differences. First, an APHF works over bilinear groups, and it is asymmetric in the sense that, while only secretly computable, it admits an iso...
Article
In this paper we consider a scenario where a user wants to outsource her documents to the cloud, so that she can later reliably delegate (to the cloud) pattern matching operations on these documents. We propose an efficient solution to this problem that relies on the homomorphic MAC for polynomials proposed by Catalano and Fiore (EuroCrypt 2013). O...
Chapter
We present new constructions of multi-input functional encryption (MIFE) schemes for the inner-product functionality that improve the state of the art solution of Abdalla et al. (Eurocrypt 2017) in two main directions. First, we put forward a novel methodology to convert single-input functional encryption for inner products into multi-input schemes...
Conference Paper
In privacy-preserving processing of outsourced data a Cloud server stores data provided by one or multiple data providers and then is asked to compute several functions over it. We propose an efficient methodology that solves this problem with the guarantee that a honest-but-curious Cloud learns no information about the data and the receiver learns...
Conference Paper
We present two practically efficient functional encryption schemes for a large class of quadratic functionalities. Specifically, our constructions enable the computation of so-called bilinear maps on encrypted vectors. This represents a practically relevant class of functions that includes, for instance, multivariate quadratic polynomials (over the...
Article
Homomorphic message authenticators allow the holder of a (public) evaluation key to perform computations over previously authenticated data, in such a way that the produced tag $$\sigma$$ can be used to certify the authenticity of the computation. More precisely, a user, knowing the secret key $$\mathsf{sk}$$ used to authenticate the original data...
Conference Paper
In this paper we consider a scenario where a user wants to outsource her documents to the cloud, so that she can later reliably delegate (to the cloud) pattern matching operations on these documents. We propose an efficient solution to this problem that relies on the homomorphic MAC for polynomials proposed by Catalano and Fiore in [14]. Our main c...

## Citations

... In such a situation, a function can be generated for the expert to only look at the transmission-control protocol (TCP) port, giving the external expert the corresponding key, and restricting their access only to the desired information. Since its introduction, functional encryption has attracted a lot of interest, and its known results are broadly categorized as either focusing on feasibility results for general functionalities, or concrete, efficient realizations for restricted functionalities of practical interest [5]. In this work, we review the recent applications of functional encryption and the major cryptographic primitives that it covers. ...
... A complementary approach to prevent double-spending of cryptographic tokens (e.g., signature keys, e-cash, etc.) is to guarantee that some secret key is revealed if two linked activities are performed, e.g., [1,4,7,13,25]. While this approach disincentivizes users to use cryptographic tokens multiple times, its practical usability is sometimes limited. ...
... , which satisfy conditions (1) to (5). ...
... The resulting schemes can be used to compute the Boolean circuit, but are not as efficient as the constructions for a specific function in realistic case. To the end of high efficiency and practical significance, we would like to propose an outsourced computation scheme for inner product based on Inner Product Functional Encryption (IPFE) [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28]. The inner product is a basic primitive in many practical applications. ...
... FE schemes have shown promising efficiency improvements to address the secure multi-party aggregation challenge compared to existing homomorphic encryption-based approaches [24]. In [24], FL systems made use of a functional encryption scheme [2] that enabled the computation of inner product using a TPA. Unlike the functional encryption scheme used in [24], this paper uses the recently proposed decentralized multi-client functional encryption (DMCFE) schemes [8,1,7]. ...
... An example of an effective fully HE algorithm scheme is shown below. Downline developed the scheme cited in [28] and allowed for addition and multiplication functions to be run on the data. The algorithm is a slight modification of Fig. 1. [18] an algorithm by Gentry, one of the major scholars working on the research, advancement, and HE implementation [28]. ...
Citing conference paper
... In order to improve the practicality of FE schemes, an FE scheme for inner-products (FE-IP) that support the inner product operation between attributes in a ciphertext and a function key was proposed by Abdalla et al. [2]. Since then, the research on FE-IP has been expanded to support function hiding, full security, and quadratic functions [6,9,10]. Goldwasser et al. [21] extended the concept of FE that handles only one ciphertext in decryption to the concept of multi-input functional encryption (MIFE) and multi-client functional encryption (MCFE) that support the evaluation of a function on multiple ciphertexts. ...
... , n. We employ a strategy for generating σ i similar to the one proposed in [21]. Particularly, we define σ i as follows: ...