International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs

Authors:
Muhammed F. Esgin , Monash University and CSIRO's Data61
Ron Steinfeld , Monash University
Dongxi Liu , CSIRO's Data61
Sushmita Ruj , University of New South Wales
Download:
DOI: 10.1007/978-3-031-38554-4_16 (login may be required)
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2023
Abstract: In this work, we study hybrid exact/relaxed zero-knowledge proofs from lattices, where the proved relation is exact in one part and relaxed in the other. Such proofs arise in important real-life applications such as those requiring verifiable PRF evaluation and have so far not received significant attention as a standalone problem. We first introduce a general framework, LANES+, for realizing such hybrid proofs efficiently by combining standard relaxed proofs of knowledge RPoK and the LANES framework (due to a series of works in Crypto'20, Asiacrypt'20, ACM CCS'20). The latter framework is a powerful lattice-based proof system that can prove exact linear and multiplicative relations. The advantage of LANES+ is its ability to realize hybrid proofs more efficiently by exploiting RPoK for the high-dimensional part of the secret witness while leaving a low-dimensional secret witness part for the exact proof that is proven at a significantly lower cost via LANES. Thanks to the flexibility of LANES+, other exact proof systems can also be supported. We apply our LANES+ framework to construct substantially shorter proofs of rounding, which is a central tool for verifiable deterministic lattice-based cryptography. Based on our rounding proof, we then design an efficient long-term verifiable random function (VRF), named LaV. LaV leads to the shortest VRF outputs among the proposals of standard (i.e., long-term and stateless) VRFs based on quantum-safe assumptions. Of independent interest, we also present generalized results for challenge difference invertibility, a fundamental soundness security requirement for many proof systems.
BibTeX
@inproceedings{crypto-2023-33082,
  title={Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs},
  publisher={Springer-Verlag},
  doi={10.1007/978-3-031-38554-4_16},
  author={Muhammed F. Esgin and Ron Steinfeld and Dongxi Liu and Sushmita Ruj},
  year=2023
}