International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: New Code-Based Privacy-Preserving Cryptographic Constructions

Authors:
Khoa Nguyen
Hanh Tang
Huaxiong Wang
Neng Zeng
Download:
DOI: 10.1007/978-3-030-34621-8_2
Search ePrint
Search Google
Abstract: Code-based cryptography has a long history but did suffer from periods of slow development. The field has recently attracted a lot of attention as one of the major branches of post-quantum cryptography. However, its subfield of privacy-preserving cryptographic constructions is still rather underdeveloped, e.g., important building blocks such as zero-knowledge range proofs and set membership proofs, and even proofs of knowledge of a hash preimage, have not been known under code-based assumptions. Moreover, almost no substantial technical development has been introduced in the last several years.This work introduces several new code-based privacy-preserving cryptographic constructions that considerably advance the state-of-the-art in code-based cryptography. Specifically, we present 3 major contributions, each of which potentially yields various other applications. Our first contribution is a code-based statistically hiding and computationally binding commitment scheme with companion zero-knowledge (ZK) argument of knowledge of a valid opening that can be easily extended to prove that the committed bits satisfy other relations. Our second contribution is the first code-based zero-knowledge range argument for committed values, with communication cost logarithmic in the size of the range. A special feature of our range argument is that, while previous works on range proofs/arguments (in all branches of cryptography) only address ranges of non-negative integers, our protocol can handle signed fractional numbers, and hence, can potentially find a larger scope of applications. Our third contribution is the first code-based Merkle-tree accumulator supported by ZK argument of membership, which has been known to enable various interesting applications. In particular, it allows us to obtain the first code-based ring signatures and group signatures with logarithmic signature sizes.
BibTeX
@article{asiacrypt-2019-30033,
  title={New Code-Based Privacy-Preserving Cryptographic Constructions},
  booktitle={Advances in Cryptology – ASIACRYPT 2019},
  series={Advances in Cryptology – ASIACRYPT 2019},
  publisher={Springer},
  volume={11922},
  pages={25-55},
  doi={10.1007/978-3-030-34621-8_2},
  author={Khoa Nguyen and Hanh Tang and Huaxiong Wang and Neng Zeng},
  year=2019
}