Sciweavers

403 search results - page 74 / 81
» An algebra for commitment protocols
Sort
View
ASIACRYPT
2009
Springer
15 years 6 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
SSD
2009
Springer
145views Database» more  SSD 2009»
15 years 6 months ago
Versioning of Network Models in a Multiuser Environment
The standard database mechanisms for concurrency control, which include transactions and locking protocols, do not provide the support needed for updating complex geographic data i...
Petko Bakalov, Erik G. Hoel, Sudhakar Menon, Vassi...
MSS
2007
IEEE
100views Hardware» more  MSS 2007»
15 years 6 months ago
Efficient Logging and Replication Techniques for Comprehensive Data Protection
Mariner is an iSCSI-based storage system that is de­ signed to provide comprehensive data protection on com­ modity ATA disk and Gigabit Ethernet technologies while offering the...
Maohua Lu, Shibiao Lin, Tzi-cker Chiueh
SMALLTALK
2007
Springer
15 years 5 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz
CRYPTO
2005
Springer
113views Cryptology» more  CRYPTO 2005»
15 years 5 months ago
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
Serge Vaudenay