Sciweavers

213 search results - page 30 / 43
» Can Homomorphic Encryption be Practical
Sort
View
CCS
2004
ACM
14 years 3 days ago
Cryptanalysis of a provably secure CRT-RSA algorithm
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...
David Wagner
AMW
2009
13 years 7 months ago
Checking Containment of Schema Mappings (Preliminary Report)
In data exchange, data are materialised from a source schema to a target schema, according to suitable source-to-target constraints. Constraints are also expressed on the target sc...
Andrea Calì, Riccardo Torlone
ITCC
2005
IEEE
14 years 9 days ago
Conversion and Proxy Functions for Symmetric Key Ciphers
As a general design criterion, a symmetric key cipher should not be closed under functional composition due to the implications on the security of the cipher. However, there are s...
Debra L. Cook, Angelos D. Keromytis
IEEEARES
2010
IEEE
13 years 5 months ago
A New DRM Architecture with Strong Enforcement
—We propose a new DRM architecture that utilizes a two-step enforcement process to enable strong security even in the case of a compromised DRM viewer. This is achieved by using ...
Sascha Müller, Stefan Katzenbeisser
ACNS
2003
Springer
193views Cryptology» more  ACNS 2003»
13 years 12 months ago
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
Rui Zhang 0002, Hideki Imai