Sciweavers

46 search results - page 2 / 10
» Universally composable two-party and multi-party secure comp...
Sort
View
FSTTCS
2010
Springer
13 years 3 months ago
Computationally Sound Abstraction and Verification of Secure Multi-Party Computations
ionally Sound Abstraction and Verification of Secure Multi-Party Computations Michael Backes Saarland University MPI-SWS Matteo Maffei Saarland University Esfandiar Mohammadi Saarl...
Michael Backes, Matteo Maffei, Esfandiar Mohammadi
CRYPTO
2010
Springer
167views Cryptology» more  CRYPTO 2010»
13 years 6 months ago
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
Ivan Damgård, Claudio Orlandi
WPES
2003
ACM
13 years 10 months ago
Leveraging the "Multi" in secure multi-party computation
Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in s...
Jaideep Vaidya, Chris Clifton
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
14 years 6 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...
IJACT
2008
102views more  IJACT 2008»
13 years 5 months ago
An optimistic fair exchange protocol and its security in the universal composability framework
: Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e-commerce. In this paper, we construct an optimi...
Yusuke Okada, Yoshifumi Manabe, Tatsuaki Okamoto