Sciweavers

41 search results - page 5 / 9
» The Correctness of Crypto Transaction Sets
Sort
View
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
14 years 26 days ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
ACMMSP
2006
ACM
257views Hardware» more  ACMMSP 2006»
14 years 2 months ago
Memory models for open-nested transactions
Open nesting provides a loophole in the strict model of atomic transactions. Moss and Hosking suggested adapting open nesting for transactional memory, and Moss and a group at Sta...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
MMB
1997
Springer
126views Communications» more  MMB 1997»
14 years 20 days ago
Goal-oriented Performance Control for Transaction Processing
The performance of current transaction processing systems largely depends on human experts for administration and tuning. These experts have to specify a multitude of internal con...
Erhard Rahm
CAV
2009
Springer
177views Hardware» more  CAV 2009»
14 years 9 months ago
Software Transactional Memory on Relaxed Memory Models
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh