391 search results - page 38 / 79 » On-Line Secret Sharing |
145
click to vote
CCS
2004
ACM
15 years 10 months ago
2004
ACM
Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a significant performance improvement when implementing ...
132
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—This paper discusses a way to communicate without relying on fixed infrastructure at some central hub. This can be useful for bootstrapping loosely connected peer-to-peer syste...
140
Voted
AAECC
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
146
click to vote
SP
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider the following problem: how can two devices that do not share any secrets establish a shared secret key over a wireless radio channel in the presence of a communication...
147
click to vote
ASIACRYPT
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. A t out of n threshold scheme is such that shares are distributed to n participants so that any set of t participants can compute the secret, whereas any set of less than...