Sciweavers

104 search results - page 4 / 21
» A secret sharing scheme based on cellular automata
Sort
View
EUROCRYPT
2000
Springer
14 years 4 days ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
INDOCRYPT
2003
Springer
14 years 1 months ago
On Multiplicative Linear Secret Sharing Schemes
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
ASIACRYPT
2008
Springer
13 years 10 months ago
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...
ICWN
2007
13 years 10 months ago
CA Based Data Servicing In Cellular Mobile Network
—This work presents an efficient data service scheme for location dependent data/objects in a cellular mobile network. It is developed around the hardware structure of cellular ...
Sukanta Das, Sipra DasBit, Biplab K. Sikdar
JISE
2008
143views more  JISE 2008»
13 years 8 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