Sciweavers

241 search results - page 18 / 49
» On Proactive Secret Sharing Schemes
Sort
View
ASIACRYPT
2005
Springer
14 years 2 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
ACISP
2004
Springer
14 years 11 days ago
Optimistic Fair Exchange Based on Publicly Verifiable Secret Sharing
Abstract. In this paper we propose an optimistic two-party fair exchange protocol which does not rely on a centralized trusted third party. Instead, the fairness of the protocol re...
Gildas Avoine, Serge Vaudenay
COMPSEC
2010
124views more  COMPSEC 2010»
13 years 7 months ago
A provably secure secret handshake with dynamic controlled matching
Abstract A Secret Handshake is a protocol that allows two users to mutually verify one another’s properties, and in case of simultaneous matching, to share a key used to secure s...
Alessandro Sorniotti, Refik Molva
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
14 years 2 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
TPDS
1998
94views more  TPDS 1998»
13 years 8 months ago
Access Control and Signatures via Quorum Secret Sharing
—We suggest a method of controlling the access to a secure database via quorum systems. A quorum system is a collection of sets (quorums) every two of which have a nonempty inter...
Moni Naor, Avishai Wool