8 search results - page 2 / 2 » Constant-Size Commitments to Polynomials and Their Applicati... |
SACRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper investigates the security of Proactive Secret Sharing Schemes. We start with revision of the mobile adversary model of Herzberg’s et al. imposing less restri...
COCO
2010
Springer
13 years 6 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
COCO
2007
Springer
13 years 9 months ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...