The knowledge complexity of quadratic residuosity languages
type: Item
instance of: scholarly article
title: The knowledge complexity of quadratic residuosity languages
zbMATH Open document ID: 0799.68102
DOI: 10.1016/0304-3975(94)90237-2
author: Alfredo De Santis
author: Giovanni Di Crescenzo
author: Giuseppe Persiano
published in: Theoretical Computer Science
publication date: 1994-09-25T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 643678
zbMATH Keywords: zero-knowledge proof
zbMATH Keywords: quadratic residuosity
zbMATH Keywords: quadratic nonresiduosity
zbMATH Keywords: graph nonisomorphism
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90237-2
OpenAlex ID: W1965163152
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Q4318714
cites work: Q5750398
cites work: Noninteractive Zero-Knowledge
cites work: Does co-NP have short interactive proofs ?
cites work: Practic zero-knowledge proofs: Giving hints and using deficiencies
cites work: Minimum disclosure proofs of knowledge
cites work: Constant-round perfect zero-knowledge computationally convincing protocols
cites work: Q4065548
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: Probabilistic encryption
cites work: The knowledge complexity of interactive proof-systems
cites work: The Lattice Point Covering Theorem for Rectangles
cites work: How to share a secret
Wikidata QID: Q127991124
description: scientific article; zbMATH DE number 643678