scientific article; zbMATH DE number 883898

zbMATH Open0853.94016MaRDI QIDQ4880146FDOQ4880146

Authors: Ronald Cramer, Berry Schoenmakers, Ivan B. Damgård 

Publication date: 6 January 1997

Title of this publication is not available (Why is that?)

Recommendations

• Publication:4940695
• Non-interactive composition of sigma-protocols via Share-then-Hash
• Unifying Zero-Knowledge Proofs of Knowledge
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• Online/offline OR composition of sigma protocols

zbMATH Keywords

communication complexitythreshold schemeprotocolsecret sharing schemezero-knowledge-proof

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (15)

• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• Efficient proofs of knowledge for threshold relations
• Title not available (Why is that?)
• On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
• On the security of classic protocols for unique witness relations
• Online/offline OR composition of sigma protocols
• Several cryptographic applications of \(\Sigma\)-protocol
• Witness hiding without extractors or simulators
• Direct proof of security of Wegman-Carter authentication with partially known key
• Non-interactive composition of sigma-protocols via Share-then-Hash
• Lower bounds for non-black-box zero knowledge
• Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol
• Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic
• Isolated Proofs of Knowledge and Isolated Zero Knowledge
• Compact proofs of partial knowledge for overlapping CNF formulae

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