Sciweavers

101 search results - page 15 / 21
» Extended visual cryptography schemes
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
15 years 10 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
EUROCRYPT
2007
Springer
15 years 3 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
ACNS
2006
Springer
121views Cryptology» more  ACNS 2006»
15 years 3 months ago
Authentication for Paranoids: Multi-party Secret Handshakes
In a society increasingly concerned with the steady assault on electronic privacy, the need for privacy-preserving techniques is both natural and justified. This need extends to t...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
ESOP
2008
Springer
14 years 11 months ago
A Formal Implementation of Value Commitment
In an optimistic approach to security, one can often simplify protocol design by relying on audit logs, which can be analyzed a posteriori. Such auditing is widely used in practice...
Cédric Fournet, Nataliya Guts, Francesco Za...
ICIP
2005
IEEE
15 years 11 months ago
Improved color filter array demosaicking by accurate luminance estimation
Luminance information plays an important role in dictating the quality of a color image, and some existing color filter array (CFA) demosaicking methods achieve superiority by fir...
Naixiang Lian, Lanlan Chang, Yap-Peng Tan