34 search results - page 3 / 7 » Non-Interactive and Information-Theoretic Secure Verifiable ... |
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
CGO
2005
IEEE
14 years 1 months ago
2005
IEEE
In this work, we develop a secret sharing based compiler solution to achieve confidentiality, integrity and availability (intrusion tolerance) of critical data together, rather th...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—In recent years, the famous wiretap channel has been revisited by many researchers and information theoretic secrecy has become an active area of research in this setting. In th...
EUROCRYPT
2003
Springer
14 years 1 months ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...