35 search results - page 7 / 7 » On the bound for anonymous secret sharing schemes |
ET
2010
13 years 3 months ago
2010
In this work we investigate the problem of simultaneous privacy and integrity protection in cryptographic circuits. We consider a white-box scenario with a powerful, yet limited at...
ICICS
2003
Springer
13 years 10 months ago
2003
Springer
The advantage of ID-based system is the simplification of key distribution and certification management; a user can directly use his identity as his public key instead of an arbi...
SCN
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
FSTTCS
2003
Springer
13 years 10 months ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...