97 search results - page 7 / 20 » Concurrent Non-Malleable Commitments |
ISECS
2008
IEEE
14 years 2 months ago
2008
IEEE
Given that resource providers and consumers may have different requirements and performance goals, concurrent negotiation is considered in this work to successfully obtain commitm...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
We describe SCC-kS, a Speculative Concurrency Control (SCC) algorithm that allows a DBMS to use efficiently the extra computing resources available in the system to increase the l...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We study the alternating-time temporal logics ATL and ATL extended with strategy contexts: these make agents commit to their strategies during the evaluation of formulas, contrary...
EUROCRYPT
2011
Springer
12 years 11 months ago
2011
Springer
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...