Sciweavers

2558 search results - page 452 / 512
» Model Composition Contracts
Sort
View
134
Voted
TCC
2009
Springer
133views Cryptology» more  TCC 2009»
16 years 4 months ago
Composing Quantum Protocols in a Classical Environment
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple q...
Serge Fehr, Christian Schaffner
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 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...
VLDB
2007
ACM
89views Database» more  VLDB 2007»
16 years 4 months ago
Effective Phrase Prediction
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...
Arnab Nandi, H. V. Jagadish
ICSE
2004
IEEE-ACM
16 years 3 months ago
A Feature-Oriented Alternative to Implementing Reliability Connector Wrappers
Connectors and connector wrappers explicitly specify the protocol of interaction among components and afford the reusable application of extra-functional behaviors, such as reliabi...
J. H. Sowell, R. E. Kurt Stirewalt
ICFP
2002
ACM
16 years 3 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani