Breakthrough in Zero-Knowledge Proofs: Sublogarithmic Discrete Logarithm Verification πŸ”

Discover a novel method for highly efficient zero-knowledge arguments in the discrete logarithm setting, achieving sublogarithmic proof sizes. Presented at Asiacrypt 2022 by Kim, Lee, and Seo.

Breakthrough in Zero-Knowledge Proofs: Sublogarithmic Discrete Logarithm Verification πŸ”
IACR
143 views β€’ Dec 3, 2022
Breakthrough in Zero-Knowledge Proofs: Sublogarithmic Discrete Logarithm Verification πŸ”

About this video

Paper by Sungwook Kim, Hyeonbum Lee, Jae Hong Seo presented at Asiacrypt 2022
See https://iacr.org/cryptodb/data/paper.php?pubkey=32541.

The conference program is at https://asiacrypt.iacr.org/2022/program.php

Video Information

Views

143

Duration

3:13

Published

Dec 3, 2022

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.

Trending Now