scientific article
From MaRDI portal
Publication:4038698
zbMath0766.68033MaRDI QIDQ4038698
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
sequential compositionparallel compositionblack-box simulation zero- knowledgeconstant-round Arthur-Merlin proofs
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items
Mathematical problems in cryptology, Practical proofs of knowledge without relying on theoretical proofs of membership on languages, On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes, Random walks and concurrent zero-knowledge, A language-dependent cryptographic primitive, An almost-constant round interactive zero-knowledge proof, A uniform-complexity treatment of encryption and zero-knowledge, Continuous verifiable delay functions, Constant-round perfect zero-knowledge computationally convincing protocols, Definitions and properties of zero-knowledge proof systems
