Sciweavers

17 search results - page 4 / 4
» Information-Theoretically Secure Voting Without an Honest Ma...
Sort
View
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 4 months ago
Secure Multiparty Computation with Partial Fairness
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
Amos Beimel, Eran Omri, Ilan Orlov
EUROCRYPT
2007
Springer
13 years 12 months ago
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
Jonathan Katz