scientific article; zbMATH DE number 4191124

MaRDI QIDQ3210182zbMATH OpenFDO

Authors René Peralta, Joan Boyar

Publication date 1990

zbMATH Keywords

protocolszero-knowledge proofscircuit-based proofs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• On the communication complexity of zero-knowledge proofs
• scientific article; zbMATH DE number 4211485
• Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
• scientific article; zbMATH DE number 1302863
• Zero-knowledge proofs from secure multiparty computation

Cited in

(18)

• Advances in Cryptology - ASIACRYPT 2003
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• scientific article; zbMATH DE number 31277 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 4211485 (Why is no real title available?)
• Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
• Perfect zero knowledge: new upperbounds and relativized separations
• On Efficient Zero-Knowledge PCPs
• On the communication complexity of zero-knowledge proofs
• On the amortized complexity of zero-knowledge protocols
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
• Polynomial-Space Approximation of No-Signaling Provers
• Complexity bounds for zero-test algorithms
• On the Composition of Zero-Knowledge Proof Systems
• scientific article; zbMATH DE number 1952907 (Why is no real title available?)
• Practical zero-knowledge proofs for circuit evaluation
• On zero-knowledge proofs (extended abstract)
• Provably Hard Zero-Way Functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210182)