Sciweavers

225 search results - page 15 / 45
» Weakly-Private Secret Sharing Schemes
Sort
View
32
Voted
ICC
2007
IEEE
186views Communications» more  ICC 2007»
14 years 1 months ago
An Efficient Cluster-Based Proactive Secret Share Update Scheme for Mobile Ad Hoc Networks
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
Ying Dong, Ai Fen Sui, Siu-Ming Yiu, Victor O. K. ...
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
14 years 1 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 ...
ISADS
1999
IEEE
13 years 11 months ago
A Secure Key Registration System based on Proactive Secret-Sharing Scheme
We designed a secure key registration system based on the proactive secret-sharing scheme. A user can register important data such as a session key to a distributed system in a (t...
Masayuki Numao
SACRYPT
2004
Springer
14 years 25 days ago
On Proactive Secret Sharing Schemes
Abstract. This paper investigates the security of Proactive Secret Sharing Schemes. We start with revision of the mobile adversary model of Herzberg’s et al. imposing less restri...
Ventzislav Nikov, Svetla Nikova
EUROCRYPT
2005
Springer
14 years 1 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...