35 search results - page 4 / 7 » On the bound for anonymous secret sharing schemes |
TPDS
2008
13 years 8 months ago
2008
Mobile Peer-to-Peer Networks (MOPNETs) have become popular applications due to their ease of communication and resource sharing patterns in unfixed network infrastructures. As priv...
TIT
2008
13 years 7 months ago
2008
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
Peer-to-Peer (P2P) computing has become a popular application model because of its easy resource sharing pattern and powerful query search scheme. However, decentralized P2P archi...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...