Sciweavers

241 search results - page 43 / 49
» On Proactive Secret Sharing Schemes
Sort
View
EUROCRYPT
2007
Springer
14 years 1 months ago
Atomic Secure Multi-party Multiplication with Low Communication
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 ...
Ronald Cramer, Ivan Damgård, Robbert de Haan
FOCS
2006
IEEE
14 years 1 months ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
USS
2008
13 years 9 months ago
Highly Predictive Blacklisting
The notion of blacklisting communication sources has been a well-established defensive measure since the origins of the Internet community. In particular, the practice of compilin...
Jian Zhang, Phillip A. Porras, Johannes Ullrich
ASIACRYPT
2009
Springer
14 years 2 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
INFOCOM
2010
IEEE
13 years 6 months ago
Randomized Differential DSSS: Jamming-Resistant Wireless Broadcast Communication
—Jamming resistance is crucial for applications where reliable wireless communication is required. Spread spectrum techniques such as Frequency Hopping Spread Spectrum (FHSS) and...
Yao Liu, Peng Ning, Huaiyu Dai, An Liu