Sciweavers

195 search results - page 13 / 39
» E-voting - a Key to Independence for All
Sort
View
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
13 years 11 months ago
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
Yitao Duan, John F. Canny
CCS
2011
ACM
12 years 7 months ago
AmazonIA: when elasticity snaps back
Cloud Computing is an emerging technology promising new business opportunities and easy deployment of web services. Much has been written about the risks and benefits of cloud co...
Sven Bugiel, Stefan Nürnberger, Thomas Pö...
DATE
2005
IEEE
109views Hardware» more  DATE 2005»
14 years 1 months ago
Design Method for Constant Power Consumption of Differential Logic Circuits
Side channel attacks are a major security concern for smart cards and other embedded devices. They analyze the variations on the power consumption to find the secret key of the en...
Kris Tiri, Ingrid Verbauwhede
ACTA
2006
108views more  ACTA 2006»
13 years 7 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
IPL
2008
93views more  IPL 2008»
13 years 7 months ago
Computing Longest Previous Factor in linear time and applications
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
Maxime Crochemore, Lucian Ilie