Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
type: Item
instance of: scholarly article
title: Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
zbMATH Open document ID: 1504.94095
DOI: 10.1007/978-3-030-56877-1_18
author: Thomas Attema
author: Ronald Cramer
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 7627832
zbMATH Keywords: \(\varSigma\)-protocols
zbMATH Keywords: bulletproofs
zbMATH Keywords: zero-knowledge
zbMATH Keywords: plug-and-play
zbMATH Keywords: secure algorithmics
zbMATH Keywords: ZK-SNARKS
zbMATH Keywords: verifiable computation
MaRDI profile type: Publication
full work available at URL: 978-3-030-56877-1 18
OpenAlex ID: W3013005985
cites work: Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
cites work: On the existence of extractable one-way functions
cites work: Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
cites work: A non-PCP approach to succinct quantum-safe zero-knowledge
cites work: Transparent SNARKs from DARK compilers
cites work: Q4394211
cites work: Q3374918
cites work: Secure Multiparty Computation and Secret Sharing
cites work: On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
cites work: Q4940695
cites work: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Q4364540
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: Linear Algebra with Sub-linear Zero-Knowledge Arguments
cites work: On the Size of Pairing-Based Non-interactive Arguments
cites work: Short Pairing-Based Non-interactive Zero-Knowledge Arguments
cites work: Parallel coin-tossing and constant-round secure two-party computation
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q4035712
cites work: Efficient verifiable delay functions
cites work: Designated Confirmer Signatures Revisited
cites work: Libra: succinct zero-knowledge proofs with optimal prover computation
description: scientific article; zbMATH DE number 7627832