Sciweavers

403 search results - page 32 / 81
» An algebra for commitment protocols
Sort
View
SRDS
2006
IEEE
15 years 5 months ago
Satem: Trusted Service Code Execution across Transactions
Web services and service oriented architectures are becoming the de facto standard for Internet computing. A main problem faced by users of such services is how to ensure that the...
Gang Xu, Cristian Borcea, Liviu Iftode
PVLDB
2010
138views more  PVLDB 2010»
14 years 10 months ago
The Case for Determinism in Database Systems
Replication is a widely used method for achieving high availability in database systems. Due to the nondeterminism inherent in traditional concurrency control schemes, however, sp...
Alexander Thomson, Daniel J. Abadi
IPL
2006
118views more  IPL 2006»
14 years 11 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
CN
2006
117views more  CN 2006»
14 years 12 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 4 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård