53 search results - page 8 / 11 » On the (Im)Possibility of Key Dependent Encryption |
DATE
2003
IEEE
14 years 23 days ago
2003
IEEE
Smart cards are vulnerable to both invasive and non-invasive attacks. Specifically, non-invasive attacks using power and timing measurements to extract the cryptographic key has d...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Following Gennaro, Gentry, and Parno (Cryptology ePrint Archive 2009/547), we use fully homomorphic encryption to design improved schemes for delegating computation. In such schem...
EUROCRYPT
2010
Springer
14 years 8 days ago
2010
Springer
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
EUROCRYPT
2011
Springer
12 years 11 months ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...