Sciweavers

14 search results - page 1 / 3
» Adaptively Secure Computation with Partial Erasures
Sort
View
CTRSA
2009
Springer
179views Cryptology» more  CTRSA 2009»
13 years 11 months ago
Adaptively Secure Two-Party Computation with Erasures
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
Andrew Y. Lindell
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
13 years 10 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
ICPADS
2005
IEEE
13 years 10 months ago
An Adaptive Multiparty Protocol for Secure Data Protection
To better protect information systems, computation time data protection needs to be considered such that even when the system is partially compromised, the security of the system ...
Qingkai Ma, Liangliang Xiao, I-Ling Yen, Manghui T...
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
14 years 5 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
ICDCS
2010
IEEE
13 years 8 months ago
Adaptive Jamming-Resistant Broadcast Systems with Partial Channel Sharing
—Wireless communication is particularly vulnerable to signal jamming attacks. Spread spectrum mitigates such problem by spreading normal narrowband signals over a much wider band...
Qi Dong, Donggang Liu