作者
Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim
发表日期
2023/7/13
图书
International Conference on Cryptology in Africa
页码范围
465-489
出版商
Springer Nature Switzerland
简介
The celebrated result by Gentry and Wichs established a theoretical barrier for succinct non-interactive arguments (SNARGs), showing that for (expressive enough) hard-on-average languages, we must assume non-falsifiable assumptions. We further investigate those barriers by showing new negative and positive results related to the proof size.
- We start by formalizing a folklore lower bound for the proof size of black-box extractable arguments based on the hardness of the language. This separates knowledge-sound SNARGs (SNARKs) in the random oracle model (that can have black-box extraction) and those in the standard model.
- We find a positive result in the non-adaptive setting. Under the existence of non-adaptively sound SNARGs (without extractability) and from standard assumptions, it is possible to build SNARKs with black-box extractability for a non-trivial subset of .
- On the other hand, we show that (under …
学术搜索中的文章
M Campanelli, C Ganesh, H Khoshakhlagh, J Siim - International Conference on Cryptology in Africa, 2023