Sciweavers

193 search results - page 2 / 39
» Universally Composable Secure Mobile Agent Computation
Sort
View
EUROCRYPT
2003
Springer
13 years 10 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
EUROCRYPT
2007
Springer
13 years 11 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
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
14 years 5 months ago
New notions of security: achieving universal composability without trusted setup
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
Manoj Prabhakaran, Amit Sahai
AINA
2007
IEEE
13 years 11 months ago
Mobile Agents and the Deus Ex Machina
This paper aims to examine the benefits the introduction of trusted computing can bring to the mobile agent paradigm, with a specific emphasis on mobile agent security.
Shane Balfe, Eimear Gallery
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...