Sciweavers

10 search results - page 1 / 2
» Simulatable Security and Polynomially Bounded Concurrent Com...
Sort
View
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
14 years 3 months ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
12 years 7 days 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
IANDC
2007
152views more  IANDC 2007»
13 years 9 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
TCC
2005
Springer
118views Cryptology» more  TCC 2005»
14 years 3 months ago
On the Relationships Between Notions of Simulation-Based Security
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. Th...
Anupam Datta, Ralf Küsters, John C. Mitchell,...
EUROCRYPT
2011
Springer
13 years 1 months ago
Concurrent Composition in the Bounded Quantum Storage Model
We define the BQS-UC model, a variant of the UC model, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in th...
Dominique Unruh