Sciweavers

Share
21 search results - page 1 / 5
» New notions of security: achieving universal composability w...
Sort
View
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
12 years 1 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
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
11 years 7 months ago
Universally Composable Security with Global Setup
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi W...
FOCS
2010
IEEE
10 years 11 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
EUROCRYPT
2003
Springer
11 years 6 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
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
9 years 3 months ago
Black-Box Constructions of Composable Protocols without Set-Up
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
Huijia Lin, Rafael Pass
books