Private visual share-homomorphic computation and randomness reduction in visual cryptography

DOI10.1007/978-3-319-49175-2_5MaRDI QIDQ2953811zbMATH OpenOpenAlexFDO

Authors Paolo D'Arco, Roberto De Prisco, Yvo Desmedt

Publication date 6 January 2017

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

Full work available at URL https://doi.org/10.1007/978-3-319-49175-2_5

zbMATH Keywords

information theorysecure computationunconditional privacyvisual cryptography

Mathematics Subject Classification ID

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

Recommendations

• Randomness in secret sharing and visual cryptography schemes
• scientific article; zbMATH DE number 1500549
• scientific article; zbMATH DE number 1588476
• Two secret sharing schemes based on Boolean operations
• Visual cryptography for general access structures

Cites work

• A full proof of the BGW protocol for perfectly secure multiparty computation
• scientific article; zbMATH DE number 6691196 (Why is no real title available?)
• scientific article; zbMATH DE number 4039795 (Why is no real title available?)
• scientific article; zbMATH DE number 1088898 (Why is no real title available?)
• Randomness in secret sharing and visual cryptography schemes
• Secure two-party computation: a visual way

Cited in

(3)

• Randomness in secret sharing and visual cryptography schemes
• Probabilistic secret sharing
• Secure computation without computers

Describes a project that uses

Uses Software

• PICCO

This page was built for publication: Private visual share-homomorphic computation and randomness reduction in visual cryptography

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