SNARGs for P from Sub-exponential DDH and QR

James Hulett; Ruta Jawale; Dakshita Khurana; Akshayaram Srinivasan

doi:10.1007/978-3-031-07085-3_18

SNARGs for P from Sub-exponential DDH and QR

James Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan

Siebel School of Computing and Data Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We obtain publicly verifiable Succinct Non-Interactive Arguments (SNARGs) for arbitrary deterministic computations and bounded space non-deterministic computation from standard group-based assumptions, without relying on pairings. In particular, assuming the sub-exponential hardness of both the Decisional Diffie-Hellman (DDH) and Quadratic Residuosity (QR) assumptions, we obtain the following results, where n denotes the length of the instance: 1.A SNARG for any language that can be decided in non-deterministic time T and space S with communication complexity and verifier runtime (n+ S) · T^o ⁽ ¹ ⁾.2.A SNARG for any language that can be decided in deterministic time T with communication complexity and verifier runtime n· T^o ⁽ ¹ ⁾.

Original language	English (US)
Title of host publication	Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings
Editors	Orr Dunkelman, Stefan Dziembowski
Publisher	Springer
Pages	520-549
Number of pages	30
ISBN (Print)	9783031070846
DOIs	https://doi.org/10.1007/978-3-031-07085-3_18
State	Published - 2022
Event	41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022 - Trondheim, Norway Duration: May 30 2022 → Jun 3 2022

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13276 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022
Country/Territory	Norway
City	Trondheim
Period	5/30/22 → 6/3/22

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Online availability

10.1007/978-3-031-07085-3_18

Library availability

Discover UIUC Full Text

Cite this

Hulett, J., Jawale, R., Khurana, D., & Srinivasan, A. (2022). SNARGs for P from Sub-exponential DDH and QR. In O. Dunkelman, & S. Dziembowski (Eds.), Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (pp. 520-549). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13276 LNCS). Springer. https://doi.org/10.1007/978-3-031-07085-3_18

SNARGs for P from Sub-exponential DDH and QR. / Hulett, James; Jawale, Ruta; Khurana, Dakshita et al.
Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. ed. / Orr Dunkelman; Stefan Dziembowski. Springer, 2022. p. 520-549 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13276 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Hulett, J, Jawale, R, Khurana, D & Srinivasan, A 2022, SNARGs for P from Sub-exponential DDH and QR. in O Dunkelman & S Dziembowski (eds), Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13276 LNCS, Springer, pp. 520-549, 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022, Trondheim, Norway, 5/30/22. https://doi.org/10.1007/978-3-031-07085-3_18

Hulett J, Jawale R, Khurana D, Srinivasan A. SNARGs for P from Sub-exponential DDH and QR. In Dunkelman O, Dziembowski S, editors, Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. Springer. 2022. p. 520-549. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-07085-3_18

Hulett, James ; Jawale, Ruta ; Khurana, Dakshita et al. / SNARGs for P from Sub-exponential DDH and QR. Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings. editor / Orr Dunkelman ; Stefan Dziembowski. Springer, 2022. pp. 520-549 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d0525ca5b127450e8391a07d8981538f,

title = "SNARGs for P from Sub-exponential DDH and QR",

abstract = "We obtain publicly verifiable Succinct Non-Interactive Arguments (SNARGs) for arbitrary deterministic computations and bounded space non-deterministic computation from standard group-based assumptions, without relying on pairings. In particular, assuming the sub-exponential hardness of both the Decisional Diffie-Hellman (DDH) and Quadratic Residuosity (QR) assumptions, we obtain the following results, where n denotes the length of the instance: 1.A SNARG for any language that can be decided in non-deterministic time T and space S with communication complexity and verifier runtime (n+ S) · To ( 1 ).2.A SNARG for any language that can be decided in deterministic time T with communication complexity and verifier runtime n· To ( 1 ).",

author = "James Hulett and Ruta Jawale and Dakshita Khurana and Akshayaram Srinivasan",

note = "Publisher Copyright: {\textcopyright} 2022, International Association for Cryptologic Research.; 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022 ; Conference date: 30-05-2022 Through 03-06-2022",

year = "2022",

doi = "10.1007/978-3-031-07085-3_18",

language = "English (US)",

isbn = "9783031070846",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "520--549",

editor = "Orr Dunkelman and Stefan Dziembowski",

booktitle = "Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings",

address = "Germany",

}

TY - GEN

T1 - SNARGs for P from Sub-exponential DDH and QR

AU - Hulett, James

AU - Jawale, Ruta

AU - Khurana, Dakshita

AU - Srinivasan, Akshayaram

PY - 2022

Y1 - 2022

N2 - We obtain publicly verifiable Succinct Non-Interactive Arguments (SNARGs) for arbitrary deterministic computations and bounded space non-deterministic computation from standard group-based assumptions, without relying on pairings. In particular, assuming the sub-exponential hardness of both the Decisional Diffie-Hellman (DDH) and Quadratic Residuosity (QR) assumptions, we obtain the following results, where n denotes the length of the instance: 1.A SNARG for any language that can be decided in non-deterministic time T and space S with communication complexity and verifier runtime (n+ S) · To ( 1 ).2.A SNARG for any language that can be decided in deterministic time T with communication complexity and verifier runtime n· To ( 1 ).

AB - We obtain publicly verifiable Succinct Non-Interactive Arguments (SNARGs) for arbitrary deterministic computations and bounded space non-deterministic computation from standard group-based assumptions, without relying on pairings. In particular, assuming the sub-exponential hardness of both the Decisional Diffie-Hellman (DDH) and Quadratic Residuosity (QR) assumptions, we obtain the following results, where n denotes the length of the instance: 1.A SNARG for any language that can be decided in non-deterministic time T and space S with communication complexity and verifier runtime (n+ S) · To ( 1 ).2.A SNARG for any language that can be decided in deterministic time T with communication complexity and verifier runtime n· To ( 1 ).

UR - http://www.scopus.com/inward/record.url?scp=85132130815&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85132130815&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-07085-3_18

DO - 10.1007/978-3-031-07085-3_18

M3 - Conference contribution

AN - SCOPUS:85132130815

SN - 9783031070846

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 520

EP - 549

BT - Advances in Cryptology – EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings

A2 - Dunkelman, Orr

A2 - Dziembowski, Stefan

PB - Springer

T2 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022

Y2 - 30 May 2022 through 3 June 2022

ER -