Sciweavers

118 search results - page 4 / 24
» Ideal Secret Sharing Schemes from Permutations
Sort
View
TIT
2008
147views more  TIT 2008»
13 years 7 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 ...
EUROCRYPT
2000
Springer
13 years 11 months 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
CANS
2008
Springer
111views Cryptology» more  CANS 2008»
13 years 9 months ago
Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
Tiancheng Lou, Christophe Tartary
TMC
2010
161views more  TMC 2010»
13 years 5 months ago
High-Rate Uncorrelated Bit Extraction for Shared Secret Key Generation from Channel Measurements
—Secret keys can be generated and shared between two wireless nodes by measuring and encoding radio channel characteristics without ever revealing the secret key to an eavesdropp...
Neal Patwari, Jessica Croft, Suman Jana, Sneha Kum...
EUROPKI
2007
Springer
14 years 1 months ago
On Partial Anonymity in Secret Sharing
Abstract. Anonymous secret sharing schemes allow a secret to be recovered from shares regardless of the identity of shareholders. Besides being interesting in its own right, this p...
Vanesa Daza, Josep Domingo-Ferrer