Sciweavers

91 search results - page 13 / 19
» Immunizing Encryption Schemes from Decryption Errors
Sort
View
NDSS
2003
IEEE
15 years 3 months ago
Proxy Cryptography Revisited
In this work we revisit and formally study the notion of proxy cryptography. Intuitively, various proxy functions allow two cooperating parties F (the “FBI”) and P (the “pro...
Anca-Andreea Ivan, Yevgeniy Dodis
ITNG
2006
IEEE
15 years 3 months ago
A Study on the Security of Privacy Homomorphism
Informally, Privacy Homomorphism (PH) refers to encryption schemes with a homomorphic property allowing to obtain Ek(a + b) or Ek(a × b) from ciphertexts Ek(a) and Ek(b) without ...
Yu Yu, Jussipekka Leiwo, Benjamin Premkumar
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Public-Key Locally-Decodable Codes
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
Brett Hemenway, Rafail Ostrovsky
ISQED
2010
IEEE
156views Hardware» more  ISQED 2010»
14 years 11 months ago
On the design of different concurrent EDC schemes for S-Box and GF(p)
Recent studies have shown that an attacker can retrieve confidential information from cryptographic hardware (e.g. the secret key) by introducing internal faults. A secure and re...
Jimson Mathew, Hafizur Rahaman, Abusaleh M. Jabir,...
SPW
2004
Springer
15 years 3 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson