scientific article; zbMATH DE number 176509

MaRDI QIDQ4035674zbMATH OpenFDO

Authors Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger

Publication date 18 May 1993

zbMATH Keywords

computationally convincingprotocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 708820
• Constant-round perfect zero-knowledge computationally convincing protocols
• The knowledge complexity of interactive proof-systems
• Strong proofs of knowledge
• A note on constant-round zero-knowledge proofs of knowledge

Cited in

(11)

• Practical proofs of knowledge without relying on theoretical proofs of membership on languages
• Proving computational ability
• On probabilistic versus deterministic provers in the definition of proofs of knowledge
• scientific article; zbMATH DE number 1335878 (Why is no real title available?)
• scientific article; zbMATH DE number 1136108 (Why is no real title available?)
• scientific article; zbMATH DE number 1990814 (Why is no real title available?)
• Computationally Sound Proofs
• scientific article; zbMATH DE number 3999326 (Why is no real title available?)
• Argument of knowledge protocol for a Goppa codeword and for an error of a bounded weigth
• On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
• Constant-round perfect zero-knowledge computationally convincing protocols

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 Q4035674)