TaSSLE: Lasso for the commitment-phobic

Daniel Dore

Paper 2024/1075

TaSSLE: Lasso for the commitment-phobic

Daniel Dore

, Lita Foundation

Abstract

We present TaSSLE, a new lookup argument for decomposable tables with minimal commitment costs. The construction generalizes techniques introduced in Lasso (Eurocrypt '24) which take advantage of the internal structure present in such tables to avoid the need for any party to need to commit to, or even construct, the entire table. This allows the use of lookups against very large tables, with applications including new design strategies for "zero-knowledge virtual machines". We show that these techniques may be combined in a generic way with any existing lookup argument to achieve similar results. We then give a construction of TaSSLE by applying this observation to a recent lookup argument, introduced in [Papini-Haböck '23], which combines logarithmic derivatives with the GKR protocol to achieve a lookup argument with minimal commitment costs.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: lookup argument proof system iop
Contact author(s): dorebell @ gmail com
History: 2024-07-02: approved; 2024-07-02: received; See all versions
Short URL: https://ia.cr/2024/1075
License: CC BY

BibTeX

@misc{cryptoeprint:2024/1075,
      author = {Daniel Dore},
      title = {{TaSSLE}: Lasso for the commitment-phobic},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1075},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1075}
}