Sciweavers

42 search results - page 7 / 9
» Cheating in Visual Cryptography
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
ACNS
2005
Springer
84views Cryptology» more  ACNS 2005»
14 years 1 months ago
Non-interactive Zero-Knowledge Arguments for Voting
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...
Jens Groth
ACNS
2006
Springer
92views Cryptology» more  ACNS 2006»
14 years 1 months ago
Real Perfect Contrast Visual Secret Sharing Schemes with Reversing
The visual secret sharing (VSS for short) scheme is a secret image sharing scheme. A secret image is visually revealed from overlapping shadow images without additional computation...
Ching-Nung Yang, Chung-Chun Wang, Tse-Shih Chen
SAT
2009
Springer
126views Hardware» more  SAT 2009»
14 years 2 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
JISE
2008
143views more  JISE 2008»
13 years 7 months ago
A Geometry-Based Secret Image Sharing Approach
This paper solves the visual cryptography problem by the Blakley scheme that is a geometry-based secret sharing strategy. We first partition the protected image into non-overlappi...
Chien-Chang Chen, Wen-Yin Fu