Secure computation without computers

DOI10.1016/j.tcs.2016.08.003zbMath1386.94070OpenAlexW2519124015MaRDI QIDQ517015

Paolo D'Arco, Roberto De Prisco

Publication date: 16 March 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.08.003

zbMATH Keywords

visual cryptographysecure computationYao's construction

Mathematics Subject Classification ID

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

Related Items (2)

How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Securely computing the \(n\)-variable equality function with \(2n\) cards

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• On the size of shares for secret sharing schemes
• Security and composition of multiparty cryptographic protocols
• Basing cryptographic protocols on tamper-evident seals
• Information-theoretically secure protocols and security under composition
• Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography
• Functional Encryption: Definitions and Challenges
• Secret-Sharing Schemes: A Survey
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Software protection and simulation on oblivious RAMs
• On secret sharing systems
• Foundations of Cryptography
• Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: Secure computation without computers