rkm0959

A Note on Ligero and Logarithmic Randomness

We revisit the Ligero proximity test, and its logarithmic randomness variant, in the framework of [EA23] and show a simple proof that improves the soundness error of the original logarithmic randomness construction of [DP23] by a factor of two. This note w

eprint.iacr.org

New Updates on Proximity Testing with Logarithmic Randomness

소개 이전 글에서, “Proximity Testing with Logarithmic Randomness”라는 논문을 소개했습니다. 이 논문을 읽은 당시에 제가 논문에 있었던 증명의 작은 오류를 찾아 이를 수정하는데 기여하기도 했으며,

infossm.github.io

Polymath: Groth16 is Not The Limit

소개 ZKP의 성능을 측정하는 요소에는 여러 가지가 있습니다. Prover와 Verifier의 입장에서 생각해보면, 가장 중요한 것은 아무래도 Prover가 proof를 생성하는데 걸리는 시간 및 리소스 Verifier가 proof를

infossm.github.io

Decoding Reed-Solomon Codes - HackMD

   owned this note    owned this note       Published Linked with GitHub # Decoding Reed-Solomon Codes When we discuss Reed-Solomon Codes or other codes in general in ZKPs, the main ingredient is really about proximity and their testing. For ex

hackmd.io

STIR: Reed-Solomon Proximity Testing with Fewer Queries - HackMD

   owned this note    owned this note       Published Linked with GitHub --- layout: post title: "STIR: Reed-Solomon Proximity Testing with Fewer Queries" date: 2024-07-26 author: rkm0959 --- # 소개 이 글은 https://eprint.iacr.org/2024/390

hackmd.io

Minimizing Foreign Arithmetic in ZKP Circuits

https://eprint.iacr.org/2024/265.pdf 논문에 대해 다룹니다. 소개 ZKP를 사용하는 과정에서 가장 핵심적인 부분은 결국 $\mathbb{F}_p$ 위의 기본적인 연산들을 통해서 프로젝트 스펙에서 필요로 하는 constraint

infossm.github.io

1/8-1/10: Fixing the Proof of [DP23] - HackMD

   owned this note    owned this note       Published Linked with GitHub # 1/8-1/10: Fixing the Proof of [[DP23]](https://eprint.iacr.org/2023/630.pdf) Continued from https://hackmd.io/c2eTRG3PSLeverwHTMkNDQ A similar approach is now integrated

hackmd.io

X의 rkm0959 | KALOS님(@rkm0959)

Here's something I've been working on the past week: finding & assisting in fixing a flaw in the extractability proof in https://t.co/BvfWzoqlJu - now fixed on eprint. discussed with @benediamond on this one, was a very fun experience. we auditing papers n

twitter.com

X의 Ben Diamond님(@benediamond)

was a pleasure working through Merkle-extraction technicalities with @rkm0959, who is very astute. fixed version now live. the gap in our old proof also affects Brakedown 😅 @SuccinctJT

twitter.com

1/12: MPC Definitions / Problems Collection - HackMD

   owned this note    owned this note       Published Linked with GitHub # 1/12: MPC Definitions / Problems Collection - chapter 23 of https://toc.cryptobook.us/book.pdf - the book https://www.cs.virginia.edu/~evans/pragmaticmpc/pragmaticmpc.pd

hackmd.io

1/13: Beaver’s Protocol - HackMD

   owned this note    owned this note       Published Linked with GitHub # 1/13: Beaver's Protocol - Chapter 23.2 of https://toc.cryptobook.us/book.pdf ## The Big Idea Consider that we want to deal with $$(y_1, \cdots, y_m) = f(x_1, \cdots, x_n

hackmd.io

1/14: Garbled Circuits - HackMD

   owned this note    owned this note       Published Linked with GitHub # 1/14: Garbled Circuits - Chapter 23.3 of https://toc.cryptobook.us/book.pdf - Chapter 3.1 of https://www.cs.virginia.edu/~evans/pragmaticmpc/pragmaticmpc.pdf - https://i

hackmd.io