Sciweavers

225 search results - page 21 / 45
» Weakly-Private Secret Sharing Schemes
Sort
View
ASIACRYPT
2005
Springer
14 years 1 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
Ronald Cramer, Serge Fehr, Martijn Stam
ICDCS
2003
IEEE
14 years 24 days ago
Responsive Security for Stored Data
We present the design of a distributed store that offers various levels of security guarantees while tolerating a limited number of nodes that are compromised by an adversary. The...
Subramanian Lakshmanan, Mustaque Ahamad, H. Venkat...
IWDW
2009
Springer
14 years 2 months ago
A Homomorphic Method for Sharing Secret Images
In this paper, we present a new method for sharing images between two parties exploiting homomorphic property of public key cryptosystem. With our method, we show that it is possib...
Naveed Islam, William Puech, Robert Brouzet
COCOON
2005
Springer
14 years 1 months ago
Error-Set Codes and Related Objects
By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the errorcorrecting codes in the sense that the minimum dis...
An Braeken, Ventzislav Nikov, Svetla Nikova