Article

Code-Based Zero Knowledge PRF Arguments

Authors:

Carlo Brunetta,

Aikaterini MitrokotsaAuthors Info & Claims

Information Security: 22nd International Conference, ISC 2019, New York City, NY, USA, September 16–18, 2019, Proceedings

Pages 171 - 189

https://doi.org/10.1007/978-3-030-30215-3_9

Published: 16 September 2019 Publication History

Abstract

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.,. Finally, we analytically evaluate the protocol’s communication costs.

References

[1]

Adleman Leonard M. Implementing an Electronic Notary Public Advances in Cryptology 1983 Boston, MA Springer US 259-265

[2]

Aguilar, C., Gaborit, P., Schrek, J.: A new zero-knowledge code based identification scheme with reduced communication. In: 2011 IEEE Information Theory Workshop (2011).

[3]

Augot D, Finiasz M, and Sendrier N Dawson E and Vaudenay S A family of fast syndrome based cryptographic hash functions Progress in Cryptology – Mycrypt 2005 2005 Heidelberg Springer 64-83

[4]

Banerjee A, Peikert C, and Rosen A Pointcheval D and Johansson T Pseudorandom functions and lattices Advances in Cryptology – EUROCRYPT 2012 2012 Heidelberg Springer 719-737

[5]

Berlekamp E, McEliece R, and Van Tilborg H On the inherent intractability of certain coding problems (Corresp.) IEEE Transact. Inf. Theory 1978 24 3 384-386

[6]

Brunetta C, Liang B, and Mitrokotsa A Lattice-based simulatable VRFs: challenges and future directions J. Internet Serv. Inf. Secur. (JISIS) 2018 8 4 57-69

[7]

Cayrel, P.L., Gaborit, P., Girault, M.: Identity-based identification and signature schemes using correcting codes. In: WCC, vol. 2007 (2007)

[8]

Cayrel, P.L., Véron, P., El Yousfi Alaoui, S.M.: A zero-knowledge identification scheme based on the q-ary syndrome decoding problem. In: Selected Areas in Cryptography (2011)

[9]

Chabaud F De Santis A On the security of some cryptosystems based on error-correcting codes Advances in Cryptology — EUROCRYPT’94 1995 Heidelberg Springer 131-139

[10]

El Yousfi Alaoui SM, Cayrel P-L, and Mohammed M Kim T, Adeli H, Robles RJ, and Balitanas M Improved identity-based identification and signature schemes using quasi-dyadic Goppa codes Information Security and Assurance 2011 Heidelberg Springer 146-155

[11]

Ezerman MF, Lee HT, Ling S, Nguyen K, and Wang H Iwata T and Cheon JH A provably secure group signature scheme from code-based assumptions Advances in Cryptology – ASIACRYPT 2015 2015 Heidelberg Springer 260-285

[12]

Fischer J-B and Stern J Maurer U An efficient pseudo-random generator provably as secure as syndrome decoding Advances in Cryptology — EUROCRYPT ’96 1996 Heidelberg Springer 245-255

[13]

Gaborit, P., Lauradoux, C., Sendrier, N.: SYND: a fast code-based stream cipher with a security reduction. In: 2007 IEEE International Symposium on Information Theory, June 2007.

[14]

Gilbert EN A comparison of signalling alphabets Bell Syst. Tech. J. 1952 31 3 504-522

[15]

Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC 1989. ACM (1989).

[16]

Goldreich O, Goldwasser S, and Micali S How to construct random functions J. ACM 1986 33 4 792-807

[17]

Hu, R., Morozov, K., Takagi, T.: Proof of plaintext knowledge for code-based public-key encryption revisited. In: ASIA CCS 2013 (2013).

[18]

Katz J and Lindell Y Introduction to Modern Cryptography 2014 Boca Raton CRC Press

[19]

Libert B, Ling S, Nguyen K, and Wang H Takagi T and Peyrin T Zero-knowledge arguments for lattice-based PRFs and applications to E-Cash Advances in Cryptology – ASIACRYPT 2017 2017 Cham Springer 304-335

[20]

Meziani M, Cayrel P-L, and El Yousfi Alaoui SM Kim T, Adeli H, Robles RJ, and Balitanas M 2SC: An efficient code-based stream cipher Information Security and Assurance 2011 Heidelberg Springer 111-122

[21]

Meziani M, Hoffmann G, and Cayrel P-L Mitrokotsa A and Vaudenay S Improving the performance of the SYND stream cipher Progress in Cryptology - AFRICACRYPT 2012 2012 Heidelberg Springer 99-116

[22]

Stern J A new paradigm for public key identification IEEE Transact. Inf. Theory 1996 42 6 1757-1768

[23]

Stern J Cohen G and Wolfmann J A method for finding codewords of small weight Coding Theory and Applications 1989 Heidelberg Springer 106-113

[24]

Varshamov RR Estimate of the number of signals in error correcting codes Docklady Akad. Nauk, S.S.S.R. 1957 117 739-741

[25]

Yu Y and Steinberger J Fischlin M and Coron J-S Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN Advances in Cryptology – EUROCRYPT 2016 2016 Heidelberg Springer 154-183

Cited By

Kuznetsov ALutsenko MBagmut MZhora V(2021)Performance Evaluation of the Classic McEliece Key Encapsulation Algorithm2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)10.1109/IDAACS53288.2021.9660833(755-760)Online publication date: 22-Sep-2021
https://dl.acm.org/doi/10.1109/IDAACS53288.2021.9660833

Index Terms

Code-Based Zero Knowledge PRF Arguments
1. Security and privacy
  1. Cryptography
2. Theory of computation
  1. Computational complexity and cryptography

Index terms have been assigned to the content through auto-classification.

Recommendations

A Code-Based Undeniable Signature Scheme
IMACC 2013: Proceedings of the 14th IMA International Conference on Cryptography and Coding - Volume 8308

In this work we propose the first code-based undeniable signature scheme and more generally the first post-quantum undeniable signature scheme. The verification protocols for our scheme are 3-pass zero-knowledge protocols derived from the Stern ...
Strengthening Zero-Knowledge Protocols Using Signatures

Recently there has been an interest in zero-knowledge protocols with stronger properties, such as concurrency, simulation soundness, non-malleability, and universal composability. In this paper we show a novel technique to convert a large class of ...
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
PQCrypto '08: Proceedings of the 2nd International Workshop on Post-Quantum Cryptography

Ring signatures were introduced by Rivest, Shamir and Tauman in 2001. Bresson, Stern and Szydlo extended the ring signature concept to <em>t</em>-out-of-<em>N</em>threshold ring signatures in 2002. We present in this paper a <em>generalization</em>of ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Information Security: 22nd International Conference, ISC 2019, New York City, NY, USA, September 16–18, 2019, Proceedings

Sep 2019

486 pages

ISBN:978-3-030-30214-6

DOI:10.1007/978-3-030-30215-3

Editors:
Zhiqiang Lin
The Ohio State University, Columbus, OH, USA
,
Charalampos Papamanthou
University of Maryland, College Park, MD, USA
,
Michalis Polychronakis
Stony Brook University, Stony Brook, NY, USA

© Springer Nature Switzerland AG 2019.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 16 September 2019

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kuznetsov ALutsenko MBagmut MZhora V(2021)Performance Evaluation of the Classic McEliece Key Encapsulation Algorithm2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)10.1109/IDAACS53288.2021.9660833(755-760)Online publication date: 22-Sep-2021
https://dl.acm.org/doi/10.1109/IDAACS53288.2021.9660833

View Options

View options

Figures

Tables

Media

View Table of Conten