On the amortized complexity of zero-knowledge protocols
type: Item
instance of: scholarly article
title: On the amortized complexity of zero-knowledge protocols
zbMATH Open document ID: 1297.94063
author: Ronald Cramer
author: Marcel Keller
author: Ivan B. Damgård
published in: Journal of Cryptology
publication date: 2014-09-25T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6347776
zbMATH Keywords: \(\varSigma\)-protocols
zbMATH Keywords: zero-knowledge
zbMATH Keywords: proof of knowledge
zbMATH Keywords: homomorphic encryption
zbMATH Keywords: random self-reducible problems
MaRDI profile type: Publication
full work available at URL: s00145-013-9145-x
OpenAlex ID: W2075960627
cites work: On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge
cites work: Semi-homomorphic Encryption and Multiparty Computation
cites work: Efficient and Secure Comparison for On-Line Auctions
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Q4364540
cites work: The knowledge complexity of interactive proof-systems
cites work: Theory of Cryptography
cites work: Zero-Knowledge Proofs from Secure Multiparty Computation
cites work: Efficient signature generation by smart cards
DOI: 10.1007/S00145-013-9145-X
description: scientific article; zbMATH DE number 6347776