Code-Based Zero Knowledge PRF Arguments
Paper i proceeding, 2019

Pseudo-random functions are a useful cryptographic primitive that, can be combined with zero-knowledge proof systems in order to achieve privacy-preserving identification. Libert et al. (ASIACRYPT 2017) has investigated the problem of proving the correct evaluation of lattice-based PRFs based on the Learning-With-Rounding (LWR) problem. In this paper, we go beyond lattice-based assumptions and investigate, whether we can solve the question of proving the correct evaluation of PRFs based on code-based assumptions such as the Syndrome Decoding problem. The answer is affirmative and we achieve it by firstly introducing a very efficient code-based PRG based on the Regular Syndrome Decoding problem and subsequently, we give a direct construction of a code-based PRF. Thirdly, we provide a zero-knowledge protocol for the correct evaluation of a code-based PRF, which allows a prover to convince a verifier that a given output y is indeed computed from the code-based PRF with a secret key k on an input x, i.e., {\$}{\$}y=f(k,x){\$}{\$}. Finally, we analytically evaluate the protocol's communication costs.

Syndrome Decoding

Coding Theory

Pseudorandom Function

Zero Knowledge

PRF Argument

Författare

Carlo Brunetta

Universita degli Studi di Trento

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. 11723 171-189

ISC 2019
New York, USA,

PRECIS: Integritet och säkerhet i bärbara datorprylar

Vetenskapsrådet (VR), 2015-01-01 -- 2018-12-31.

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Telekommunikation

Datavetenskap (datalogi)

Datorsystem

DOI

10.1007/978-3-030-30215-3_9

Mer information

Senast uppdaterat

2019-11-21