36 search results - page 3 / 8 » Robust Secret Sharing Schemes Against Local Adversaries |
STOC
2000
ACM
14 years 2 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W to agree on a secret key R in the presence of an active ...
EUROCRYPT
2000
Springer
14 years 2 months ago
2000
Springer
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
MTA
2007
13 years 10 months ago
2007
This paper addresses the problem of ensuring the integrity of a digital video and presents a scalable signature scheme for video authentication based on cryptographic secret sharin...
TCC
2009
Springer
14 years 11 months ago
2009
Springer
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...