ZK Hints
Daily Digest 每日摘要 View All 查看全部
cryptography101.ca has released a video lecture on LLL lattice basis reduction algorithm, providing a detailed introduction to lattice theory, LLL algorithm, and its applications in cryptanalysis, including mathematical background and practical examples. cryptography101.ca 发布了关于LLL格基约简算法的视频讲座，详细介绍了格理论、LLL算法及其在密码分析中的应用，包括数学背景和实际示例。
Key Points: 要点：
- • LLL algorithm is a powerful tool in cryptanalysis, applicable to various attack scenarios LLL算法是密码分析中的强大工具，适用于多种攻击场景
- • The course covers linear algebra and lattice theory, making it easy for beginners to understand 课程涵盖线性代数和格理论等数学背景，便于初学者理解
- • The video lecture includes a complete series from foundation to application, such as Gauss algorithm and Gram-Schmidt orthogonalization 视频讲座包括从基础到应用的完整系列，如Gauss算法和Gram-Schmidt正交化
- • Error correction and additional materials are provided to ensure content accuracy 提供错误修正和额外材料，确保内容准确性
- • Emphasizes the practical application of LLL in cryptography, such as solving the shortest vector problem 强调LLL在密码学中的实际应用，如解决最短向量问题
- • Supports educators in integrating resources to promote cryptography education 支持教育者整合资源，促进密码学教学
@zksecurityXYZ discussed the recent multi-project refutation of the proximity conjecture in the blog, analyzing the impact on the security and performance of hash-based SNARKs, including the necessity of parameter adjustment. @zksecurityXYZ 在博客中讨论了近期多项研究证伪邻近间隙猜想的影响，分析了其对基于哈希的SNARKs安全性和性能的后果，包括参数调整的必要性。
Key Points: 要点：
- • The proximity conjecture has been refuted, affecting the parameter settings of hash-based SNARKs 邻近间隙猜想被证伪，影响基于哈希的SNARKs参数设置
- • Unsafe parameter regions have been identified, requiring adjustment of δ values to avoid security risks 不安全参数区域被识别，需调整δ值以避免安全风险
- • From speculative security to proven security, proof size and verification time double, prover time remains 从推测安全到证明安全，证明大小和验证时间翻倍，证明者时间基本不变
- • From speculative security to new speculative security, performance decreases by 2-3%, prover time impact is small 从推测安全到新推测安全，性能下降2-3%，证明者时间影响小
- • The problem is related to list decoding, and the remaining unknown regions' security remains unresolved 问题与列表解码问题相关，剩余未知区域安全性未解
- • It is recommended to prioritize parameter security in audits and development to avoid performance and security trade-offs 建议在审计和开发中优先考虑参数安全，避免性能与安全权衡失误
Vitalik Buterin in blog discussed the private information retrieval protocol Plinko, including how it achieves efficient privacy reading, reduces communication and computational overhead, and applies to blockchain data queries. Vitalik Buterin 在博客中讨论了私有信息检索协议 Plinko，包括其如何实现高效隐私读取、降低通信和计算开销，并应用于区块链数据查询等场景。
Key Points: 要点：
- • Plinko protocol achieves efficient PIR through preprocessing and reversible PRF, reducing communication and computational overhead Plinko 协议通过预处理和可逆 PRF 实现高效 PIR，降低通信和计算开销
- • The protocol supports single-server settings, enhancing privacy security without trust assumptions 协议支持单服务器设置，无需信任假设，提升隐私安全性
- • Randomization techniques protect client index privacy during the query phase, preventing server inference 查询阶段使用随机化技术保护客户端索引隐私，防止服务器推断
- • Can be further optimized with FHE, but current efficiency issues remain unresolved 可结合 FHE 进一步优化，但当前效率问题待解决
- • Suitable for privacy-protected database queries, blockchain data reading, etc. 适用于隐私保护数据库查询、区块链数据读取等场景
- • Actual deployment requires considering storage and bandwidth costs, such as Ethereum state tree queries 实际部署需考虑存储和带宽成本，例如以太坊状态树查询
TACEO team shared a PSS solution, combining MPC and ZK technology to achieve decentralized, privacy, and verifiability, and introduced OPRF, OMap, and Proof three core services. TACEO团队在博客中分享了Private Shared State（PSS）解决方案，结合MPC和ZK技术实现去中心化、隐私和可验证性，并介绍了OPRF、OMap和Proof三大核心服务。
Key Points: 要点：
- • PSS integrates MPC and ZK to achieve decentralized, privacy, and verifiability PSS结合MPC和ZK，同时实现去中心化、隐私和可验证性
- • TACEO:OPRF provides anonymous identity recognition, preventing Sybil attacks without revealing user information TACEO:OPRF提供匿名身份识别，防止Sybil攻击且不泄露用户信息
- • TACEO:OMap uses ORAM technology to avoid access pattern attacks, protecting data privacy TACEO:OMap通过ORAM技术避免访问模式攻击，保护数据隐私
- • TACEO:Proof allows generating coSNARK proofs by delegating computation burden to users TACEO:Proof允许委托生成coSNARK证明，降低用户计算负担
- • The network architecture includes a coordinator layer, MPC nodes, and coSNARK engines, ensuring efficient security 网络架构包括协调层、MPC节点和coSNARK引擎，确保高效安全
- • Performance indicators: Payment throughput reaches 200 TPS, identity proof generation is about 1 second 性能指标：支付吞吐量达200 TPS，身份证明生成约1秒
@zksecurityXYZ shared a S-two book, teaching how to write AIR, Cairo AIR implementation, and Circle STARKs details. @zksecurityXYZ 分享了与 @StarkWareLtd 合作开发的S-two书籍，内容包括学习如何编写AIR、Cairo AIR实现以及Circle STARKs技术细节。
Key Points: 要点：
- • S-two is the next generation verifier of Starkware, adopting Circle STARKs technology S-two是Starkware的下一代证明器，采用Circle STARKs技术
- • Implemented on the Mersenne31 prime field, providing high-performance proof generation 在Mersenne31素数域上实现，提供高性能证明生成
- • Supports custom circuits, including virtual machines (VM) and machine learning (ML) inference 支持自定义电路，包括虚拟机(VM)和机器学习(ML)推理
- • The book covers writing AIR, implementing Cairo AIR, and details of Circle STARKs 书籍内容涵盖AIR编写、Cairo AIR实现和Circle STARKs细节
- • zkSecurity provides audit, research, and development services for ZK systems zkSecurity提供ZK系统审计、研究和开发服务
- • Encourages readers to refer to related blog series to deepen their understanding of Circle STARKs 鼓励读者参考相关博客系列以深入了解Circle STARKs
@zksecurityXYZ shared a Sumcheck tutorial, teaching Sumcheck protocol and MLEs through interactive SageMath tutorials, including a complete implementation and exercises from basic to advanced ZKP protocols. @zksecurityXYZ 分享了Sumcheck教程，通过SageMath交互式教程掌握Sumcheck协议和MLEs，包括从基础到高级ZKP协议的完整实现和练习。
Key Points: 要点：
- • The tutorial uses SageMath to build Sumcheck and MLEs from scratch 教程使用SageMath构建Sumcheck和MLEs从零开始
- • Covers a complete learning path from basic concepts to advanced protocols like HyperPlonk 涵盖从基础概念到高级协议如HyperPlonk的完整学习路径
- • Includes interactive code and exercises to enhance learning effectiveness 包括交互式代码和练习，提升学习效果
- • Sumcheck protocol is thoroughly explained as a core component of modern ZK systems Sumcheck协议作为现代ZK系统的核心组件被详细讲解
- • Fiat-Shamir conversion is used to convert interactive protocols into non-interactive proofs Fiat-Shamir转换用于将交互式协议转为非交互式证明
- • The tutorial is modular, allowing users to learn by interest 教程结构模块化，允许用户按兴趣跳转学习
Ethereum Foundation in blog shared its commitment to privacy, including the importance of privacy, the composition of EF privacy cluster, and key projects such as PSE and IPTF, aiming to integrate privacy into the core of the Ethereum ecosystem. Ethereum Foundation在博客中分享了其对隐私的承诺，包括隐私的重要性、EF隐私集群的组成以及关键项目如PSE和IPTF，旨在将隐私融入以太坊生态核心。
Key Points: 要点：
- • Privacy is the core of digital trust, important for individuals, developers, and institutions 隐私是数字信任的核心，对个人、开发者和机构至关重要
- • EF privacy cluster includes PSE team, focusing on frontier cryptography research such as ZKP EF隐私集群包括PSE团队，专注于ZKP等前沿密码学研究
- • Key projects include private read-write, private proofs, and private identity, enhancing user experience 关键项目包括隐私读写、隐私证明和身份，提升用户体验
- • IPTF connects regulators with privacy technology to address real-world cases 机构隐私任务组（IPTF）连接监管与隐私技术解决实际用例
- • Open-source tools like Semaphore and Kohaku are widely used in privacy research in the ecosystem 开源工具如Semaphore和Kohaku已广泛用于生态隐私研发
- • EF commits to working with the ecosystem to make privacy an equal attribute of Ethereum EF致力于与生态合作，使隐私成为以太坊的一等属性
Abbaszadeh et al. proposed a single-server private outsourcing zkSNARK framework, which utilizes EMSM primitives to reduce client computation by 20 times, and protect witness and proof privacy. Abbaszadeh等人在论文中提出了一种单服务器私有外包zkSNARK框架，通过EMSM原语实现客户端计算降低20倍，并保护见证和证明隐私。
Key Points: 要点：
- • Proposed a single-server private outsourcing zkSNARK framework, which utilizes EMSM primitives to reduce client computation by 20 times, and protect witness and proof privacy. 提出单服务器私有外包zkSNARK，解决高证明成本问题
- • Supports mainstream zkSNARKs such as Nova, Groth16, and Plonk 核心为EMSM原语，基于LPN假设，保护见证和证明隐私
- • Reduces client computation by 20 times and decreases proof latency by 9 times 支持主流zkSNARK如Nova、Groth16和Plonk
- • Implemented and evaluated the construction, verifying practicality and performance improvements 客户端计算降低20倍，证明延迟减少9倍
- • Security depends on LPN variants, ensuring information leak during outsourcing 实现并评估构造，验证实用性和性能提升
- • 安全性依赖于LPN变体，确保外包过程无信息泄露
Ztarknet team open-sourced Ztarknet project, proposing a Starknet-based L2 solution for Zcash, using Circle STARK proofs to validate state transitions on Zcash L1, supporting Cairo program execution and transparent Zcash extensions. Ztarknet 团队开源了Ztarknet项目，提出基于Starknet的L2解决方案，使用Circle STARK证明在Zcash L1上验证状态转换，支持Cairo程序执行和透明Zcash扩展。
Key Points: 要点：
- • Use Circle STARK proofs to verify L2 state transitions, enhancing security 使用Circle STARK证明验证L2状态转换，增强安全性
- • Verify directly on Zcash L1 using the TZE framework to avoid script changes 通过TZE框架在Zcash L1原生验证，避免Script更改
- • Integrate Madara and Stwo/Cairo to optimize Rust ecosystem development 集成Madara和Stwo/Cairo，优化Rust生态系统开发
- • Data availability is minimized during PoC stage, and further evaluation is needed 数据可用性在PoC阶段最小化，需后续评估
- • Anchor the UTXO chain mode to ensure L2 progress synchronizes with L1 锚定UTXO链模式，确保L2进展与L1同步
- • The project is in concept stage, providing development resources and testing guidelines 项目处于概念阶段，提供开发资源和测试指南
Remco Bloemen analyzed the performance of Merkle multi-proofs in hash-based proofs, deriving the exact distribution of proof size and verifier work, including expected values, variances, and probability mass functions. Remco Bloemen在博客中分析了Merkle多证明在哈希证明系统中的性能，推导了证明大小和验证者工作量的精确分布，包括期望值、方差和概率质量函数。
Key Points: 要点：
- • Merkle proofs are the core of hash-based proofs, affecting proof size and verifier work Merkle证明是哈希证明系统的核心，影响证明大小和验证者工作量
- • Index distribution is uniform random sampling with replacement, allowing precise performance analysis 索引分布为均匀随机有放回抽样，允许精确性能分析
- • Derived the exact distribution of proof size and verifier work, including expected values, variances, and probability mass functions 推导了证明大小和验证者工作量的期望值、方差和概率质量函数
- • Supports compressed multi-proofs and pure verifier-end implementation, improving efficiency 支持压缩多证明和纯验证者端实现，提升效率
- • Analysis extends to imperfect trees and mixed branch trees, adapting to different vector lengths 分析可扩展至非完美树和混合分支树，适应不同向量长度
- • Provides efficient calculation methods and approximate formulas, suitable for practical applications 提供了高效计算方法和近似公式，适用于实际应用场景
Kaviani and Setty proposed Vega system in paper, which uses folding reuse and lookup centralized arithmetization to achieve low-latency ZKP, without trusted setup, significantly improving digital identity authentication efficiency. Kaviani和Setty在论文中提出Vega系统，利用折叠重用和查找中心化算术化技术，实现低延迟ZKP，无需可信设置，显著提升数字身份验证效率。
Key Points: 要点：
- • Vega does not require a trusted setup, reducing security dependencies Vega无需可信设置，降低安全依赖
- • Folding reuse technology reduces repeated calculations, improving efficiency 折叠重用技术减少重复计算，提升效率
- • Lookup centralized arithmetization optimizes field extraction and hashing 查找中心化算术化优化字段提取和哈希
- • Proof size and latency are better than existing technologies 证明大小和延迟优于现有技术
- • Supports digital identity privacy protection 支持数字身份隐私保护
Bünz et al. proposed TensorSwitch, a hash-based multi-linear polynomial commitment scheme in paper, which significantly optimizes prover time and proof size, suitable for SNARG designs. Bünz等人在论文中提出了TensorSwitch，一种基于哈希的多线性多项式承诺方案，显著优化了证明者时间和证明大小，适用于SNARG设计。
Key Points: 要点：
- • TensorSwitch optimizes the prover time and proof size of PCs to reduce ZK proof overhead TensorSwitch优化PCS的证明者时间和证明大小，降低ZK证明开销
- • It uses linear codes and interactive predicative models, which can be compiled into standard cryptographic PCs 使用线性码和交互式预言模型，可编译为标准密码学PCS
- • Commitment time depends on coding rate ρ and encoding time τ, supporting efficient gate operations 承诺时间依赖码率ρ和编码时间τ，支持高效场运算
- • Verification time grows logarithmically, suitable for large-scale polynomial processing 验证时间对数级增长，适合大规模多项式处理
- • Proof size is minimal, only O(log log n) witnesses 证明大小极小，仅O(log log n)预言，提升可扩展性
- • Built on hashing for increased security and reduced dependence on complex cryptographic assumptions 基于哈希构建，增强安全性，减少对复杂密码学假设的依赖
@zksecurityXYZ in blog discussed common traps in Circom, including missing output constraints, unverified input assumptions, and signed comparison operators. @zksecurityXYZ 在博客中讨论了Circom电路设计中的常见陷阱，包括输出约束缺失、输入假设未验证和比较运算的符号问题，强调了安全性漏洞的预防措施。
Key Points: 要点：
- • Output constraints are common vulnerabilities, such as IsEqual output not forced to 1 can be exploited by malicious users 输出约束缺失是常见漏洞源，如IsEqual输出未强制为1可被恶意利用
- • Input assumptions can cause AND gate output errors, need to add boolean constraints like flag*(flag-1)=0 输入假设未验证可导致AND门输出错误，需添加布尔约束如flag*(flag-1)=0
- • Circom comparison operators are based on signed integers, val function maps elements to (-p/2, p/2] interval Circom比较运算符基于有符号整数，val函数映射元素到(-p/2, p/2]区间
- • Large integer templates like BigLessThan output without constraints can allow out-of-bound inputs, need to explicitly check outputs 大整数模板如BigLessThan输出未约束可允许越界输入，需显式检查输出
- • Security best practices: always explicitly constrain component outputs and inputs, avoid relying on implicit assumptions 安全最佳实践：始终显式约束组件输出和输入，避免依赖隐式假设
- • Comparison operators' signed semantics may cause p/2 > p/2+1 etc. counterintuitive results, need to pay attention to witness generation 比较运算符的有符号语义可能导致p/2 > p/2+1等反直觉结果，需在见证生成时注意
Bowe and Miers in paper proposed a new technique for scalable anonymous payments via evolving nullifiers and oblivious synchronization, allowing validators to permanently trim nullifiers without affecting privacy or user costs. Bowe和Miers在论文中提出了一种通过演化无效器和遗忘同步实现可扩展匿名支付的新技术，允许验证者永久修剪无效器而不影响隐私或用户开销。
Key Points: 要点：
- • Anonymous payment protocols have linear growth of nullifiers, limiting scalability 匿名支付协议存在无效器线性增长问题，限制扩展性
- • Evolutionary nullifiers allow permanent trimming of nullifiers without destroying unspent funds 演化无效器技术允许永久修剪无效器，不破坏未花费资金
- • Oblivious synchronization model uses remote services to generate concise proofs, services are unaware of transaction details 遗忘同步模型使用远程服务生成简洁证明，服务对交易细节不可知
- • Services maintain temporary states, users can freely switch services 服务仅维护临时状态，用户可自由切换服务
- • This technology does not increase user computation, bandwidth, or latency costs 该技术不增加用户计算、带宽或延迟开销
- • Enhances privacy protection, preventing service linking users with transactions 增强隐私保护，防止服务链接用户与交易
Lauri Peltonen in blog shared the basic knowledge of Lagrange interpolation, including its definition, steps, and applications, and mentioned the importance of polynomial interpolation in ZKP. Lauri Peltonen在博客中分享了Lagrange插值方法的基础知识，包括其定义、步骤和应用，并提及了在ZKP中多项式插值的重要性。
Key Points: 要点：
- • Lagrange interpolation generates the unique lowest degree polynomial through all given points Lagrange插值生成唯一最低次多项式通过所有给定点
- • Interpolation can be used for data recovery, such as audio data recovery 插值可用于数据恢复，如音频丢失数据填补
- • In ZKP, polynomial interpolation supports efficient verification and comparison 在ZKP中，多项式插值支持高效验证和比较
- • Schwartz-Zippel lemma allows verification of polynomials through a few points Schwartz-Zippel引理允许通过少数点验证多项式
- • Lagrange method is simple and easy to understand, suitable for teaching and basic implementation Lagrange方法简单易懂，适合教学和基础实现
- • In practical applications, other methods such as FFT may be more efficient 实际应用中，FFT等其他方法可能更高效
Chen et al. proposed a linear-time and logarithmically-sound permutation and multiset SNARK in their paper, eliminating quadratic proof overhead through a linear-algebraic perspective, avoiding auxiliary commitments for efficient verification. Chen等人在论文中提出了一种线性时间且对数可靠的置换和多重集SNARK，通过线性代数视角消除二次证明开销，无需辅助承诺即可实现高效验证。
Key Points: 要点：
- • New method avoids auxiliary commitments, reducing soundness errors and enhancing security 新方法避免辅助承诺，降低可靠性错误风险，增强安全性
- • Linear-algebraic perspective allows partial evaluation without additional algebraic costs, optimizing performance 线性代数视角使部分评估无额外代数成本，优化性能
- • Supports permutation proofs from provers without preprocessing, enhancing flexibility 支持证明者提供置换，无需预处理，提高灵活性
- • Verifiers can evaluate permutations in O(polylog(n)) time, reducing dependency on provers 验证者可O(polylog(n))时间评估置换，减少对证明者依赖
- • Matches optimal prover bounds, ensuring theoretical efficiency 匹配最优证明者下界，确保理论效率
- • Field-independent design extends application scope, improving universality 域无关设计扩展应用范围，提升通用性
Crites and Stewart in paper disproved multiple Reed-Solomon proximity gap conjectures, supporting the security and efficiency of FRI, DEEP-FRI, and other SNARK systems, and proposed minimal modifications to meet list decoding capacity bounds. Crites和Stewart在论文中证伪了多个Reed-Solomon邻近间隙猜想，这些猜想支撑FRI、DEEP-FRI等SNARK系统的安全性与效率，并提出最小修改方案。
Key Points: 要点：
- • Disproved multiple Reed-Solomon proximity gap conjectures, affecting the security of FRI, DEEP-FRI, and other SNARK systems 证伪多个Reed-Solomon邻近间隙猜想，影响FRI、DEEP-FRI等SNARK安全
- • Proposed minimal modifications to meet list decoding capacity bounds 提出最小修改方案以符合列表解码容量界限
- • Proved the relationship between related protocols and list decoding, solving open problems 证明相关协议与列表解码的关联，解决开放问题
- • May weaken the security of ZK proof systems relying on these conjectures 可能削弱依赖这些猜想的ZK证明系统安全性
- • Need to re-evaluate the theoretical foundations of existing proof systems 需重新评估现有证明系统的理论基础
- • Provides new research directions for coding theory and ZK 为编码理论和ZK领域提供新的研究方向
Justin Thaler in paper analyzed the application of sum-check protocol in fast SNARK design, emphasizing its minimization of prover work through batch evaluation and memory checks. Justin Thaler在论文中分析了sum-check协议在快速SNARK设计中的应用，强调其通过批处理评估、内存检查等技术最小化证明者工作。
Key Points: 要点：
- • sum-check protocol is the core of fast SNARK design, minimizing commitment and proof costs sum-check协议是快速SNARK设计的核心，能最小化承诺和证明成本
- • Batch evaluation and memory checks significantly reduce prover workloads 批处理评估和内存检查技术可显著减少证明者工作量
- • Virtual polynomials and sparse sum-checks improve protocol efficiency 虚拟多项式和稀疏sum-checks方法提升协议效率
- • Small-value preservation optimizes computational structure utilization 小值保持技术优化计算结构利用
- • The survey emphasizes the potential of sum-check in zkVMs and other applications 该调查强调sum-check在zkVMs等应用中的潜力
- • The paper provides practical guidance for SNARK design, focusing on performance improvements 论文为SNARK设计提供实用指导，聚焦实际性能提升
Thomas et al. proposed a cryptographic personas system in their paper , which supports users in creating unlinkable anonymous identities in communities and revoking anonymous publishing capabilities when users violate rules, optimizing real-time application performance through offline proof generation and proof folding. Thomas等人在论文中提出了加密角色系统，支持用户在社区中创建不可链接的匿名身份，并在违反规范时撤销匿名发布能力，通过离线证明生成和证明折叠技术优化实时应用性能。
Key Points: 要点：
- • Proposes 'Cryptographic Personas' for revocable, responsible anonymity. 提出可撤销匿名权的“Cryptographic Personas”，实现负责任的匿名发言。
- • Builds a stateful anonymous credential system on zk-promises. 基于 zk-promises 构建可更新状态的匿名凭证体系。
- • Uses Privacy Pass to offline proof generation and cut latency. 利用 Privacy Pass 将证明生成离线化，显著降低延迟。
- • Applies Proof Folding to boost server efficiency. 采用 Proof Folding 优化服务器验证性能。
- • Implements a prototype in Signal group chats. 在 Signal 群聊中实现原型验证其实用性。
- • Balances anonymity and community accountability cryptographically. 平衡匿名自由与社群治理的密码学方案。
Frolov et al. proposed a continuous anonymous authentication (CAA) scheme named zk-Cookies in their paper , which utilizes zkSNARKs for efficient behavior signal analysis to prevent credential sharing and theft, and supports differential privacy. Frolov等人在论文中提出了一种连续匿名认证方案(CAA) zk-Cookies，使用zkSNARKs实现高效行为信号分析，防止凭证共享和盗窃，并支持差分隐私。
Key Points: 要点：
- • Shifts behavior signal processing to the client, reducing server data collection CAA方案将行为信号处理移至客户端，减少服务器数据收集
- • Utilizes zkSNARKs for efficient computation and privacy protection 使用zkSNARKs实现高效计算和隐私保护
- • Supports common behavior signals such as IP addresses, geolocation, and browser fingerprints 支持IP地址、地理位置、浏览器指纹等常见行为信号
- • Prototype application for age verification based on traditional credentials 原型应用用于基于传统凭证的年龄验证
- • Integrates differential privacy analysis to enhance data security 集成差分隐私分析，提升数据安全性
- • Performance optimization, updating operations completed in 200 milliseconds 计算性能优化，更新操作在200毫秒内完成
Leona Hioki from Intmax proposed a range proof mechanism for Pedersen commitments based on Merkle trees, avoiding ZK verification and pairings, reducing transaction costs. 来自Intmax的Leona Hioki在论文中提出了一种基于Merkle树的Pedersen承诺范围证明机制，通过锚定和轻量级验证避免ZK验证和配对运算，降低交易成本。
Key Points: 要点：
- • Avoids repeated ZK verification and pairings in each transaction, reducing computational overhead 避免每笔交易的重ZK验证和配对运算，降低计算开销
- • Uses Merkle trees and anchor mechanism to ensure privacy of range proofs 使用Merkle树和锚定机制确保范围证明的隐私性
- • Combines DLEQ and Schnorr proofs for enhanced security 结合DLEQ和Schnorr证明强化安全性
- • Verification cost is low, requiring only Merkle proofs, DLEQ, and Schnorr proofs 验证成本低，仅需Merkle证明、DLEQ和Schnorr证明
- • Suitable for EVM environment, optimizing gas usage 适用于EVM环境，优化gas使用
- • Preprint form, not yet peer-reviewed 预印本形式发布，尚未正式同行评审
@billwu1999 released zkEnc open source project, including based on Circom defining decryption conditions, supporting R1CS, allowing high-performance encryption in terminal, Node.js and browser. @billwu1999 发布了zkEnc开源项目，包括基于Circom定义解密条件、支持R1CS等特性，允许在终端、Node.js和浏览器中实现高性能加密。
Key Points: 要点：
- • Witness encryption allows encryption to computation statements, not keys 见证加密允许加密到计算语句，而非密钥
- • Using Circom circuits to define decryption conditions, supporting R1CS 使用Circom电路定义解密条件，支持R1CS
- • Can be deployed in terminal, Node.js, and browser 可在终端、Node.js和浏览器中部署
- • Based on Rust and WASM for high performance 基于Rust和WASM实现高性能
- • No key exchange or trusted third party required 无需密钥交换或可信第三方
- • Emphasizing verifiable computation and privacy security 强调可验证计算和隐私安全
- • Author clarified the work's security remains unproven. [Link](https://x.com/billwu1999/status/1985375556226224252) 作者已澄清该工作仍无法证明安全性。[链接](https://x.com/billwu1999/status/1985375556226224252)