35 search results - page 5 / 7 » On the bound for anonymous secret sharing schemes |
PODC
2010
ACM
13 years 7 months ago
2010
ACM
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
IMA
1999
Springer
13 years 11 months ago
1999
Springer
Recent years have seen numerous examples when designs play an important role in the study of such topics in cryptography as secrecy and authentication codes, secret sharing scheme...
CRYPTO
2001
Springer
13 years 12 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
ASIACRYPT
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. Group signature schemes are fundamental cryptographic tools that enable unlinkably anonymous authentication, in the same fashion that digital signatures provide the basis...
DCC
2010
IEEE
13 years 7 months ago
2010
IEEE
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...