Distributed pseudorandom functions for general access structures in NP
Paper i proceeding, 2018

Distributed pseudorandom functions (DPRFs) originally introduced by Naor, Pinkas and Reingold (EUROCRYPT ’99) are pseudorandom functions (PRFs), whose computation is distributed to multiple servers. Although by distributing the function computation, we avoid single points of failures, this distribution usually implies the need for multiple interactions with the parties (servers) involved in the computation of the function. In this paper, we take distributed pseudorandom functions (DPRFs) even further, by pursuing a very natural direction. We ask if it is possible to construct distributed PRFs for a general class of access mechanism going beyond the threshold access structure and the access structure that can be described by a polynomial-size monotone span programs. More precisely, our contributions are two-fold and can be summarised as follows: (i) we introduce the notion of single round distributed PRFs for a general class of access structure (monotone functions in NP), (ii) we provide a provably secure general construction of distributed PRFs for every mNP access structure from puncturable PRFs based on indistinguishable obfuscation.

Function secret sharing

Puncturable PRFs

Distributed pseudorandom functions

Författare

Bei Liang

Chalmers, Data- och informationsteknik, Nätverk och system

Aikaterini Mitrokotsa

Chalmers, Data- och informationsteknik, Nätverk och system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 10631 LNCS 81-87
978-3-319-89499-7 (ISBN)

19th International Conference on Information and Communications Security, ICICS 2017
Beijing, China,

Ämneskategorier

Algebra och logik

Geometri

Matematisk analys

DOI

10.1007/978-3-319-89500-0_7

Mer information

Senast uppdaterat

2024-09-17