Parallel divertibility of proofs of knowledge. (Extended abstract)

DOI10.1007/BFB0053431MaRDI QIDQ4365735zbMATH OpenFDO

Authors Torben P. Pedersen, Ivan B. Damgård, L. Chen

Publication date 18 November 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0053431

zbMATH Keywords

divertible proof systemsinteractive proofszero-knowledge proof systems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4211487
• scientific article; zbMATH DE number 503348
• Divertible zero-knowledge proof of polynomial relations and blind group signature
• Divertible and subliminal-free zero-knowledge proofs for languages

Cited in

(7)

• Divertible and subliminal-free zero-knowledge proofs for languages
• A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
• Divertible protocols and atomic proxy cryptography
• Divertible zero-knowledge proof of polynomial relations and blind group signature
• scientific article; zbMATH DE number 503348 (Why is no real title available?)
• Off-line electronic cash based on secret-key certificates
• Access with pseudonyms

This page was built for publication: Parallel divertibility of proofs of knowledge. (Extended abstract)

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