Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
type: Item
instance of: scholarly article
title: Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
zbMATH Open document ID: 1504.94127
DOI: 10.1007/978-3-030-56877-1_27
author: Geoffroy Couteau
author: Dominik Hartmann
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 7627841
zbMATH Keywords: zero-knowledge arguments
zbMATH Keywords: non-interactive zero-knowledge arguments
zbMATH Keywords: satistical witness-indistinguishability
zbMATH Keywords: pairing-based cryptography
zbMATH Keywords: tight security
zbMATH Keywords: structure-preserving signatures
MaRDI profile type: Publication
full work available at URL: 978-3-030-56877-1 27
OpenAlex ID: W3013097088
cites work: Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
cites work: Compact structure-preserving signatures with almost tight security
cites work: Shorter QA-NIZK and SPS with tighter security
cites work: Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
cites work: Ring signatures: logarithmic-size, no setup -- from standard assumptions
cites work: Statistical ZAP arguments
cites work: Advances in Cryptology - CRYPTO 2003
cites work: P-signatures and Noninteractive Anonymous Credentials
cites work: Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
cites work: Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting
cites work: Batch Groth–Sahai
cites work: An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Fiat-Shamir and correlation intractability from strong KDM-secure encryption
cites work: Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
cites work: Ring Signatures of Sub-linear Size Without Random Oracles
cites work: Q4940695
cites work: Q4737235
cites work: Theory of Cryptography
cites work: Shorter quadratic QA-NIZK proofs
cites work: Zaps and Their Applications
cites work: Fine-Tuning Groth-Sahai Proofs
cites work: An algebraic framework for Diffie-Hellman assumptions
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: The algebraic group model and its applications
cites work: Tightly CCA-Secure Encryption Without Pairings
cites work: More efficient (almost) tightly secure structure-preserving signatures
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: Separating succinct non-interactive arguments from all falsifiable assumptions
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Shorter ring signatures from standard assumptions
cites work: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
cites work: A Non-interactive Shuffle with Pairing Based Verifiability
cites work: Non-interactive Zaps and New Techniques for NIZK
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: Efficient Non-interactive Proof Systems for Bilinear Groups
cites work: Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
cites work: Tightly Secure Signatures and Public-Key Encryption
cites work: Secure Hybrid Encryption from Weakened Key Encapsulation
cites work: Improved (almost) tightly-secure structure-preserving signatures
cites work: Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
cites work: Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
cites work: Statistical witness indistinguishability (and more) in two messages
cites work: From obfuscation to the security of Fiat-Shamir for proofs
cites work: Structure-Preserving Signatures from Standard Assumptions, Revisited
cites work: Quasi-Adaptive NIZK for Linear Subspaces Revisited
cites work: Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
cites work: Compactly Hiding Linear Spans
cites work: Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
cites work: Q4949336
cites work: Unifying Zero-Knowledge Proofs of Knowledge
cites work: The Kernel Matrix Diffie-Hellman Assumption
cites work: Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
cites work: Q4474199
cites work: How to share a secret
cites work: Information Security Practice and Experience
Recommended article: Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
Recommended article: Short Pairing-Based Non-interactive Zero-Knowledge Arguments
Recommended article: Short Non-interactive Zero-Knowledge Proofs

Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (cites work)
cites work: Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Recommended article)
Recommended article: Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
Similarity Score: 0.8905802
Recommender Run: Recommender Run 3

Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Recommended article)
Recommended article: Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
Similarity Score: 0.8890202
Recommender Run: Recommender Run 3

Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Recommended article)
Recommended article: Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
Similarity Score: 0.88602084
Recommender Run: Recommender Run 3

Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Recommended article)
Recommended article: Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost
Similarity Score: 0.8777236
Recommender Run: Recommender Run 3

Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Recommended article)
Recommended article: Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
Similarity Score: 0.8745174
Recommender Run: Recommender Run 3

Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Recommended article)
Recommended article: An efficient noninteractive zero-knowledge proof system for NP with general assumptions
Similarity Score: 0.8712187
Recommender Run: Recommender Run 3

Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Recommended article)
Recommended article: Non-interactive zero-knowledge proofs with fine-grained security
Similarity Score: 0.869643
Recommender Run: Recommender Run 3