Sciweavers

193 search results - page 1 / 39
» Universally Composable Secure Mobile Agent Computation
Sort
View
ISW
2004
Springer
13 years 10 months ago
Universally Composable Secure Mobile Agent Computation
We study the security challenges faced by the mobile agent paradigm, where code travels and performs computations on remote hosts in an autonomous manner. We define universally co...
Ke Xu, Stephen R. Tate
FOCS
2003
IEEE
13 years 10 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 4 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
INDOCRYPT
2005
Springer
13 years 10 months ago
A Universally Composable Scheme for Electronic Cash
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
Mårten Trolin
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
13 years 10 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz