36 search results - page 3 / 8 » Robust Secret Sharing Schemes Against Local Adversaries |
140
click to vote
STOC
2000
ACM
15 years 4 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...
105
click to vote
CORR
2008
Springer
15 years 1 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
15 years 4 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
15 years 12 days 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...
121
click to vote
TCC
2009
Springer
16 years 1 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...