118 search results - page 20 / 24 » Ideal Secret Sharing Schemes from Permutations |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
ASIACRYPT
2003
Springer
14 years 1 months ago
2003
Springer
Provable security usually makes the assumption that a source of perfectly random and secret data is available. However, in practical applications, and especially when smart cards a...
EUROCRYPT
1995
Springer
13 years 12 months ago
1995
Springer
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
INFOCOM
1998
IEEE
14 years 20 days ago
1998
IEEE
This paper suggests that, to match an ideal Internet gateway which rigorously enforces fair sharing among competing TCP connections, an ideal TCP sender should possess two propert...
EUROCRYPT
2009
Springer
14 years 9 months ago
2009
Springer
A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish...