Secret sharing and perfect zero knowledge

DOI10.1007/3-540-48329-2_7MaRDI QIDQ4341734zbMATH OpenFDO

Authors Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano

Publication date 20 July 1997

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

Full work available at URL https://doi.org/10.1007/3-540-48329-2_7

zbMATH Keywords

non-interactive modelnon-interactive zero knowledgesecret sharing schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Secret Sharing and Statistical Zero Knowledge
• Noninteractive Zero-Knowledge
• Multiplicative non-abelian sharing schemes and their application to threshold cryptography

Cited in

(14)

• The knowledge complexity of quadratic residuosity languages
• Secret sharing and duality
• Secret Sharing and Statistical Zero Knowledge
• The graph clustering problem has a perfect zero-knowledge interactive proof
• scientific article; zbMATH DE number 2185759 (Why is no real title available?)
• scientific article; zbMATH DE number 4191075 (Why is no real title available?)
• Multiplicative non-abelian sharing schemes and their application to threshold cryptography
• Randomness-efficient non-interactive zero knowledge
• Several cryptographic applications of -protocol
• scientific article; zbMATH DE number 826068 (Why is no real title available?)
• Non-interactive Proofs for Integer Multiplication
• Non-interactive zero-sharing with applications to private distributed decision making
• Theory of Cryptography
• Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages

This page was built for publication: Secret sharing and perfect zero knowledge

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