Sciweavers

403 search results - page 46 / 81
» An algebra for commitment protocols
Sort
View
DC
1999
14 years 11 months ago
A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
Michel Hurfin, Michel Raynal
ESOP
2004
Springer
15 years 5 months ago
Trust Management in Strand Spaces: A Rely-Guarantee Method
We show how to combine trust management theories with nonce-based cryptographic protocols. The strand space framework for protocol analysis is extended by associating formulas from...
Joshua D. Guttman, F. Javier Thayer, Jay A. Carlso...
ASIACRYPT
2008
Springer
15 years 1 months ago
Universally Composable Adaptive Oblivious Transfer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
Matthew Green, Susan Hohenberger
CORR
2004
Springer
166views Education» more  CORR 2004»
14 years 11 months ago
A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they commu...
Marie Lalire, Philippe Jorrand
CORR
2007
Springer
155views Education» more  CORR 2007»
14 years 11 months ago
Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity
—The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matri...
G. Susinder Rajan, B. Sundar Rajan