Sciweavers

6978 search results - page 1303 / 1396
» On Proofs in System P
Sort
View
ATAL
2011
Springer
12 years 9 months ago
Information-driven interaction-oriented programming: BSPL, the blindingly simple protocol language
We present a novel approach to interaction-oriented programming based on declaratively representing communication protocols. Our approach exhibits the following distinguishing fea...
Munindar P. Singh
IACR
2011
113views more  IACR 2011»
12 years 8 months ago
Fully Homomorphic SIMD Operations
At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations...
Nigel P. Smart, Frederik Vercauteren
CTRSA
2012
Springer
229views Cryptology» more  CTRSA 2012»
12 years 4 months ago
Practical Realisation and Elimination of an ECC-Related Software Bug Attack
We analyse and exploit implementation features in OpenSSL version 0.9.8g which permit an attack against ECDH-based functionality. The attack, although more general, can recover the...
Billy Bob Brumley, Manuel Barbosa, Dan Page, Frede...
SIGCOMM
2012
ACM
11 years 11 months ago
User-level data center tomography
Measurement and inference in data centers present a set of opportunities and challenges distinct from the Internet domain. Existing toolsets may be perturbed or be mislead by issu...
Neil Alexander Twigg, Marwan Fayed, Colin Perkins,...
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 11 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...
« Prev « First page 1303 / 1396 Last » Next »