A noiseless key-homomorphic PRF: Application on distributed storage systems
Date
2016
Authors
Parra, J.R.
Chan, T.
Ho, S.W.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016, vol.9723, pp.505-513
Statement of Responsibility
Conference Name
21st Australasian Conference on Information Security and Privacy, ACISP 2016 (4 Jul 2016 - 6 Jul 2016 : Melbourne, Australia)
Abstract
Key-homomorphic pseudo random functions (KH-PRF) have many practical applications including proxy re-encryption, distributed credential protection systems and updatable encryption.We present a key-homomorphic pseudo random function that is homomorphic with respect to a significant part of the secret key and analyse its security. Previous constructions rely on the learning with errors problem which adds some small error to the homomorphic operations due to the noisy outputs. Our construction, based on elliptic curves, removes the need of adding this noise at the cost of adding a few bits to the secret key for which homomorphism does not follow. The main advantage of our construction is that homomorphism can be applied several times without incurring into errors. In particular, we show how our KH-PRF can be used to provide key updatable encryption to distributed storage networks. Also, by relaxing the security assumptions, our PRF can be modified to be homomorphic with respect to the entire key.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2016 Springer