ZK Hints
Daily Digest 每日摘要 View All 查看全部
Zhang et al. systematized PIOP-based SNARKs for general computation in , proposing a unified framework that refines frontend-backend decomposition and integrates lookup arguments and recursive composition. Zhang等人在论文中系统化分析了基于PIOP的SNARKs通用计算方案，提出统一框架，细化前端后端分解，并整合查找参数与递归证明组合。
Key Points: 要点：
- • PIOP combined with PCS is the dominant SNARK paradigm PIOP结合多项式承诺方案（PCS）是主流SNARK范式
- • Proposes a unified framework refining Thaler's frontend-backend decomposition at finer granularity 提出统一框架，细化Thaler的前后端分解为更细粒度组件
- • Incorporates lookup arguments as core components 将查找参数（lookup arguments）作为核心组件整合入框架
- • Integrates recursive proof composition for improved efficiency and applicability 纳入递归证明组合，提升效率和适用性
- • Systematically analyzes component interactions to clarify modern SNARK construction 系统梳理组件间交互，助于理解现代SNARK构造与分析
Arunachalaramanan et al. present a tutorial and survey on private information retrieval (PIR) in their paper, covering various PIR schemes, their extensions, efficiency comparisons, and guidance for practical deployment. Arunachalaramanan等人在论文中撰写了关于私有信息检索（PIR）的教程与综述，介绍了多种PIR方案及其扩展，并比较了不同范式的实际效率，为选择方案和探索高级主题提供指导。
Key Points: 要点：
- • PIR enables private database retrieval without revealing which entry is accessed. PIR允许用户从公开数据库检索条目而不泄露检索目标
- • Covers IT-secure, computational, single-/multi-server, and preprocessing models. 综述覆盖了信息论安全、计算安全、单服务器及多服务器等不同设定
- • Extensions for keyword and batch queries are introduced. 介绍了支持关键词查询和批量查询的PIR扩展
- • Efficiency comparisons and selection guidance provided for different paradigms. 分析了不同PIR范式的具体效率，帮助读者根据需求选择方案
- • Discusses practical applications of PIR. 讨论了PIR的实际应用场景
- • Serves as an introduction for readers new to the field and a springboard for advanced topics. 旨在帮助初学者理解当前研究格局并迈向更高级话题
Castejon-Molina et al. proposed a cryptographic collateralized loan protocol without smart contracts in their paper, introducing VGES to encrypt signatures on a graph, ensuring decryption only after repayments along valid paths, compatible with Bitcoin. Castejon-Molina等人在论文中提出无需智能合约的加密抵押贷款协议，引入新原语VGES，用于图加密签名，确保只有在完成图中路径对应的还款后才能解密签名，支持比特币等有限脚本区块链。
Key Points: 要点：
- • Proposes a cryptographic collateralized loan protocol for limited‑scripting blockchains (e.g., Bitcoin) without smart contracts. 提出面向有限脚本区块链（如比特币）的抵押贷款密码协议，无需智能合约。
- • Introduces VGES, a new primitive to encrypt signatures on a graph, ensuring decryption only after valid repayment paths. 引入新原语VGES（可验证图加密签名），确保签名仅在图路径还款完成后解密。
- • Relies on oracles but uses only basic on‑chain transactions, enabling wide compatibility. 协议依赖预言机，但利用链上基本交易实现逻辑，兼容性广。
- • Provides two constructions with trade‑off between on‑chain transaction count and off‑chain computation. 给出两种构造，提供链上交易数量与链下计算开销的权衡。
- • Implementation shows efficiency on commodity hardware, deployable on Bitcoin‑like chains. 实现评估显示在普通硬件上均高效，可部署于比特币等链。
- • Extends the possibility of contract‑free, cross‑chain cryptographic lending. 纯密码学方法扩展了跨链无合约借贷的可能性。
Lai and Maino, in their paper, propose efficient zkSNARK for isogeny-based cryptography using optimized Vélu formulas and theta model to encode various isogeny relations in R1CS, with applications to DeuringVRF signatures, SQISign, and POKÉ key validation, removing extra assumptions. Lai和Maino在论文中提出了面向同源密码的高效zkSNARK方案，通过优化Vélu公式和theta模型为多种同源关系提供R1CS编码，并展示了在DeuringVRF签名、SQISign和POKÉ密钥验证中的应用，移除了额外安全假设。
Key Points: 要点：
- • Existing ZKP for isogenies limited to small-degree chains, inefficient. 现有同源密码的ZKP局限于小次数同源链，效率低
- • Provide efficient R1CS for - and -isogenies and masked evaluations via optimized Vélu formulas. 利用优化的Vélu公式为 - 和 -同源及其掩码求值提供高效 R1CS 编码
- • Design R1CS for non-smooth isogenies of special degrees using theta model. 基于theta模型为特殊度数非光滑同源设计R1CS
- • Compiler removes 'one-more' evaluation assumption in DeuringVRF signatures. 构建编译器消除DeuringVRF签名中的“one-more”求值假设
- • Eliminate hint-based assumption in SQISign; conceptual key validation for POKÉ. 移除SQISign的提示假设，并概念性设计POKÉ密钥验证机制
- • Experimental proof sizes around 400 KB under NIST-1 primes. 实验显示在NIST-1素数下证明大小约400 KB