Secure two-party computation: a visual way

DOI10.1007/978-3-319-04268-8_2MaRDI QIDQ2948250zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Secure computation without computers
• Information Security and Cryptology
• Secure two-party computation is practical
• Secure multiparty computation without one-way functions
• scientific article; zbMATH DE number 1418289

Cites work

• scientific article; zbMATH DE number 6691196 (Why is no real title available?)
• scientific article; zbMATH DE number 176543 (Why is no real title available?)
• scientific article; zbMATH DE number 1088898 (Why is no real title available?)
• A proof of security of Yao's protocol for two-party computation
• Basing cryptographic protocols on tamper-evident seals
• Color visual cryptography schemes for black and white secret images
• Colored visual cryptography without color darkening
• Contrast Optimal Threshold Visual Cryptography Schemes
• Contrast-optimal k out of n secret sharing schemes in visual cryptography
• Foundations of Cryptography
• Functional encryption: definitions and challenges
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• On secret sharing systems
• Optimal colored threshold visual cryptography schemes
• Secret-Sharing Schemes: A Survey
• Security and composition of multiparty cryptographic protocols
• Security in Communication Networks
• Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels
• Using colors to improve visual cryptography for black and white images
• Visual cryptography for general access structures

Cited in

(3)

• Private visual share-homomorphic computation and randomness reduction in visual cryptography
• Information Security and Cryptology
• Secure computation without computers

This page was built for publication: Secure two-party computation: a visual way

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