rkm0959

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

1/4: Studying FRI Soundness - HackMD

   owned this note    owned this note       Published Linked with GitHub # 1/4: Studying FRI Soundness I actually skipped over a lot of parts on this, mostly intuitive understanding only. The reason for this was that the proof techniques were w

hackmd.io

1/5: Proximity Testing with Logarithmic Randomness - HackMD

   owned this note    owned this note       Published Linked with GitHub # 1/5: [[DP23]](https://eprint.iacr.org/2023/630.pdf): Logarithmic Randomness ## Summary Recall the statement from [1/3: Ligero's Proof for $q < d'/3$](https://hackmd.io/k

hackmd.io

1/6: [DP23] Proof of Extractability - HackMD

   owned this note    owned this note       Published Linked with GitHub # 1/6: [[DP23]](https://eprint.iacr.org/2023/630.pdf) Proof of Extractability + Efficiency Continued from https://hackmd.io/keVLzFSrQdmCcmUVh2l_BQ ## Part 1: Extractor Def

hackmd.io

1/2: Succinct Proofs and Linear Algebra - HackMD

   owned this note    owned this note       Published Linked with GitHub # 1/2: Succinct Proofs and Linear Algebra preparation for studying Binius / more code-related PCS stuff fundamentally note: this write-up is really for my understanding -

hackmd.io

1/3: Ligero’s Proof for q < d'/3 - HackMD

   owned this note    owned this note       Published Linked with GitHub # 1/3: [Ligero](https://eprint.iacr.org/2022/1608.pdf)'s Proof for $q < d'/3$ This is also used in Brakedown for its soundness proof. It's for general codes, so... The mai

hackmd.io

Folding Part 2: HyperNova

이 글에서는 ZKP에서 사용되는 테크닉인 folding의 두 대표적인 논문인 ProtoStar와 HyperNova 중 HyperNova에 대해서 다룬다. https://eprint.iacr.org/2023/573.pdf Preliminaries Incremental Verifiable Computation Incrementally Veri

infossm.github.io

Folding Part 1: ProtoStar

이 글에서는 ZKP에서 사용되는 테크닉인 folding의 두 대표적인 논문인 ProtoStar와 HyperNova 중 ProtoStar에 대해서 다룹니다. https://eprint.iacr.org/2023/620.pdf Folding이란 무엇이며, ProtoStar의 목표는 무엇인가

infossm.github.io

Multilinear PCS from Univariate PCS

저번 포스팅에서는 Multilinear Polynomial에 대한 linear-time commitment 중 하나인 Brakedown에 대해서 알아보았습니다. Sumcheck 관련 기법들이 떠오르면서, Multilinear Polynomial의 commitment에 대한 기법들이 더욱

infossm.github.io

Brakedown Overview

이 내용은 https://eprint.iacr.org/2021/1043 의 요약입니다. 이 논문의 목표는 Linear Code를 기반으로 한 Linear-Time PCS를 준비하고 이를 Spartan에 적용하여 Linear-Time Field-Agnostic SNARK를 얻는 것입니다. Spartan 계

infossm.github.io

Hash Functions Monolith for ZK Applications: May the Speed of SHA-3 be With You

이 내용은 https://eprint.iacr.org/2023/1025.pdf 의 요약입니다. ZK Friendly Hash Function의 필요성 해시함수는 굉장히 많은 곳에서 사용되고 있습니다. 그런만큼 ZKP 상에서도 해시함수의 계산에 대한 증명을

infossm.github.io