On subversion-resistant SNARKs
type: Item
instance of: scholarly article
title: On subversion-resistant SNARKs
zbMATH Open document ID: 1467.94021
author: Behzad Abdolmaleki
author: Helger Lipmaa
author: Janno Siim
author: Michal Zajac
published in: Journal of Cryptology
publication date: 2021-07-02T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7367488
zbMATH Keywords: common reference string
zbMATH Keywords: generic group model
zbMATH Keywords: non-interactive zero knowledge
zbMATH Keywords: subversion zero knowledge
zbMATH Keywords: SNARK
describes a project that uses: Pinocchio
describes a project that uses: SNARKs for C
MaRDI profile type: Publication
full work available at URL: s00145-021-09379-y
OpenAlex ID: W3157112142
cites work: A subversion-resistant SNARK
cites work: On QA-NIZK in the BPK Model
cites work: Hierarchical Identity Based Encryption with Constant Size Ciphertext
cites work: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
cites work: On the existence of extractable one-way functions
cites work: Scalable Zero Knowledge via Cycles of Elliptic Curves
cites work: NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
cites work: Resettable zero-knowledge (extended abstract)
cites work: Q4035738
cites work: Square Span Programs with Applications to Succinct NIZK Arguments
cites work: Succinct NP Proofs from an Extractability Assumption
cites work: An Algebraic Framework for Diffie-Hellman Assumptions
cites work: The algebraic group model and its applications
cites work: A Shuffle Argument Secure in the Generic Model
cites work: Non-interactive zaps of knowledge
cites work: Subversion-zero-knowledge SNARKs
cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: Updatable and universal common reference strings with applications to zk-SNARKs
cites work: Definitions and properties of zero-knowledge proof systems
cites work: Non-interactive Zaps and New Techniques for NIZK
cites work: Pairings for cryptographers
cites work: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
cites work: Short Pairing-Based Non-interactive Zero-Knowledge Arguments
cites work: On the Size of Pairing-Based Non-interactive Arguments
cites work: Separating succinct non-interactive arguments from all falsifiable assumptions
cites work: How to Hash into Elliptic Curves
cites work: Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
cites work: Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
cites work: Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
cites work: Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs
cites work: Cryptography and Coding
cites work: Q4783744
cites work: Complexity of a determinate algorithm for the discrete logarithm
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Q4409112
cites work: Q3851616
DOI: 10.1007/S00145-021-09379-Y
Recommended article: A subversion-resistant SNARK
Recommended article: Subversion-zero-knowledge SNARKs
Recommended article: Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
Recommended article: Subversion-resilient public key encryption with practical watchdogs
Recommended article: Security of Auditing Protocols Against Subversion Attacks
Recommended article: Subversion-resilient signatures: definitions, constructions and applications
Recommended article: Subversion-resilient enhanced privacy ID
Recommended article: Universally composable subversion-resilient cryptography
Recommended article: Subversion-resilient authenticated encryption without random oracles
description: scientific article; zbMATH DE number 7367488