Secure Two-Party Computation: A Visual Way

DOI10.1007/978-3-319-04268-8_2zbMath1395.94276OpenAlexW1189973164MaRDI QIDQ2948250

Paolo D'Arco, Roberto De Prisco

Publication date: 30 September 2015

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-04268-8_2

zbMATH Keywords

visual cryptographysecure computationYao's construction

Mathematics Subject Classification ID

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

Related Items (1)

Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Color visual cryptography schemes for black and white secret images
• A proof of security of Yao's protocol for two-party computation
• Colored visual cryptography without color darkening
• Contrast-optimal k out of n secret sharing schemes in visual cryptography
• Security and composition of multiparty cryptographic protocols
• Basing cryptographic protocols on tamper-evident seals
• Optimal colored threshold visual cryptography schemes
• Visual cryptography for general access structures
• Functional Encryption: Definitions and Challenges
• Using Colors to Improve Visual Cryptography for Black and White Images
• Secret-Sharing Schemes: A Survey
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Contrast Optimal Threshold Visual Cryptography Schemes
• On secret sharing systems
• Foundations of Cryptography
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Security in Communication Networks
• Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels

This page was built for publication: Secure Two-Party Computation: A Visual Way