Sciweavers

1471 search results - page 6 / 295
» Composing concurrency control
Sort
View
CRYPTO
2001
Springer
153views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Universally Composable Commitments
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
Ran Canetti, Marc Fischlin
FUIN
2002
94views more  FUIN 2002»
14 years 9 months ago
A Class of Composable and Preemptible High-level Petri Nets with an Application to Multi-Tasking Systems
This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of pre...
Hanna Klaudel, Franck Pommereau
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
13 years 1 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
ICFP
2007
ACM
15 years 9 months ago
Adding delimited and composable control to a production programming environment
Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advant...
Matthew Flatt, Gang Yu, Robert Bruce Findler, Matt...
CCS
2009
ACM
15 years 10 months ago
D-algebra for composing access control policy decisions
This paper proposes a D-algebra to compose decisions from multiple access control policies. Compared to other algebrabased approaches aimed at policy composition, D-algebra is the...
Qun Ni, Elisa Bertino, Jorge Lobo