Sciweavers

100 search results - page 15 / 20
» Asynchronous Secure Multiparty Computation in Constant Time
Sort
View
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
GIS
2009
ACM
14 years 9 months ago
Efficient and Secure Distribution of Massive Geo-Spatial Data
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
Hao Yuan, Mikhail J. Atallah
ICC
2008
IEEE
121views Communications» more  ICC 2008»
14 years 3 months ago
Maximization of Network Survival Time in the Event of Intelligent and Malicious Attacks
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
Po-Hao Tsang, Frank Yeong-Sung Lin, Chun-Wei Chen
LCN
2005
IEEE
14 years 2 months ago
Secure Content Delivery using Key Composition
In this paper, we propose a novel framework for secure multicast on overlay networks. Our contributions are threefold: 1) a technique key composition is proposed to cope with the ...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Hann...
EUROCRYPT
2010
Springer
14 years 1 months ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...