Sciweavers

14824 search results - page 2959 / 2965
» Security - Introduction
Sort
View
IACR
2011
104views more  IACR 2011»
13 years 10 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia
81
Voted
IACR
2011
86views more  IACR 2011»
13 years 10 months ago
Protecting Drive Encryption Systems Against Memory Attacks
Software drive encryption systems are vulnerable to memory attacks, in which an attacker gains physical accesses to the unattended computer, obtains the decryption keys from memor...
Leo Dorrendorf
IACR
2011
125views more  IACR 2011»
13 years 10 months ago
On Constructing Homomorphic Encryption Schemes from Coding Theory
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
Frederik Armknecht, Daniel Augot, Ludovic Perret, ...
AOSD
2012
ACM
13 years 6 months ago
Reusing non-functional concerns across languages
Emerging languages are often source-to-source compiled to mainstream ones, which offer standardized, fine-tuned implementations of non-functional concerns (NFCs)—including pers...
Myoungkyu Song, Eli Tilevich
ASPLOS
2012
ACM
13 years 6 months ago
Data races vs. data race bugs: telling the difference with portend
Even though most data races are harmless, the harmful ones are at the heart of some of the worst concurrency bugs. Alas, spotting just the harmful data races in programs is like ...
Baris Kasikci, Cristian Zamfir, George Candea
« Prev « First page 2959 / 2965 Last » Next »