
Anca Nitulescu
Presentation
On the (In)security of SNARKs in the Presence of Oracles
Dario Fiore and Anca Nitulescu
Abstract: In this work we study the feasibility of knowledge extraction for succinct non-interactive arguments of knowledge (SNARKs) in a scenario that, to the best of our knowledge, has not been analyzed before. While prior work focuses on the case of adversarial provers that may receive (statically generated) {\em auxiliary information}, here we consider the scenario where adversarial provers are given {\em access to an oracle}. For this setting we study if and under what assumptions such provers can admit an extractor. Our contribution is mainly threefold.
First, we formalize the question of extraction in the presence of oracles by proposing a suitable proof of knowledge definition for this setting. We call SNARKs satisfying this definition O-SNARKs. Second, we show how to use O-SNARKs to obtain formal and intuitive security proofs for three applications (homomorphic signatures, succinct functional signatures, and SNARKs on authenticated data) where we recognize an issue while doing the proof under the standard proof of knowledge definition of SNARKs. Third, we study whether O-SNARKs exist, providing both negative and positive results. On the negative side, we show that, assuming one way functions, there do not exist O-SNARKs in the standard model for every signing oracle family (and thus for general oracle families as well). On the positive side, we show that when considering signature schemes with appropriate restrictions on the message length O-SNARKs for the corresponding signing oracles exist, based on classical SNARKs and assuming extraction with respect to specific distributions of auxiliary input.
Category / Keywords: foundations / succinct non-interactive arguments, knowledge extraction, digital signatures
Original Publication (with major differences): IACR-TCC-2016
Date: received 10 Feb 2016, last revised 23 Aug 2016
Contact author: dario fiore at imdea org
Publications
Publications
|
MyOPE: Malicious SecuritY for Oblivious Polynomial EvaluationSCN 2022 - 13th Conference on Cryptography and Security for Networks, Sep 2022, Amalfi, Italy. pp.663-686, ⟨10.1007/978-3-031-14791-3_29⟩
Conference papers
hal-03820565
v1
|
Robust Password-Protected Secret SharingESORICS 2016 - 21st European Symposium on Research in Computer Security, Sep 2016, Heraklion, Greece. pp.61-79, ⟨10.1007/978-3-319-45741-3_4⟩
Conference papers
hal-01380699
v1
|
|
Characterization of Real-Life PRNGs under Partial State CorruptionCCS '14 Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Nov 2014, Scottsdale, Arizona, United States. pp.1004-1015, ⟨10.1145/2660267.2660377⟩
Conference papers
hal-01084490
v1
|
Robust Password-Protected Secret Sharing[Technical Report] Cryptology ePrint Archive: Report 2016/123, IACR. 2016
Reports
(Technical report)
hal-01380730
v1
|