Sciweavers

36 search results - page 1 / 8
» Strongly Secure Linear Network Coding
Sort
View
IEICET
2008
44views more  IEICET 2008»
13 years 4 months ago
Strongly Secure Linear Network Coding
Kunihiko Harada, Hirosuke Yamamoto
TIT
2008
147views more  TIT 2008»
13 years 4 months ago
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
ASIACRYPT
2008
Springer
13 years 6 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...
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
ICICS
2009
Springer
13 years 11 months ago
Design of Reliable and Secure Multipliers by Multilinear Arithmetic Codes
Abstract. We propose an efficient technique for the detection of errors in cryptographic circuits introduced by strong adversaries. Previously a number of linear and nonlinear err...
Zhen Wang, Mark G. Karpovsky, Berk Sunar, Ajay Jos...