118 search results - page 21 / 24 » Ideal Secret Sharing Schemes from Permutations |
CCS
2008
ACM
13 years 10 months ago
2008
ACM
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
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...
EUROCRYPT
2007
Springer
14 years 2 months ago
2007
Springer
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Jamming resistance is crucial for applications where reliable wireless communication is required. Spread spectrum techniques such as Frequency Hopping Spread Spectrum (FHSS) and...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...