International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Jae Hong Seo

Publications

Year
Venue
Title
2022
ASIACRYPT
Efficient Zero-Knowledge Arguments in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier
Sungwook Kim Hyeonbum Lee Jae Hong Seo
We propose three interactive zero-knowledge arguments for arithmetic circuit of size N in the common random string model, which can be converted to be non-interactive by Fiat-Shamir heuristics in the random oracle model. First argument features O( log N ) communication and round complexities and O(N) computational complexity for the verifier. Second argument features O(log N ) communication and O( N ) computational complexity for the verifier. Third argument features O(log N ) communication and O( N log N ) computational complexity for the verifier. Contrary to first and second arguments, the third argument is free of reliance on pairing-friendly elliptic curves. The soundness of three arguments is proven under the standard discrete logarithm and/or the double pairing assumption, which is at least as reliable as the decisional Diffie-Hellman assumption.
2017
JOFC
2014
CRYPTO
2013
PKC
2013
EUROCRYPT
2012
TCC
2012
PKC
2012
ASIACRYPT
2011
PKC
2009
PKC

Program Committees

Asiacrypt 2021
Asiacrypt 2020
PKC 2019
PKC 2018
Asiacrypt 2018
Crypto 2016
Asiacrypt 2016
PKC 2015
Asiacrypt 2015