Sciweavers

224 search results - page 8 / 45
» Secure Computation from Random Error Correcting Codes
Sort
View
ISQED
2010
IEEE
156views Hardware» more  ISQED 2010»
13 years 8 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,...
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
13 years 8 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
IJNSEC
2007
118views more  IJNSEC 2007»
13 years 6 months ago
Code-based Ring Signature Scheme
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosy...
Dong Zheng, Xiangxue Li, Kefei Chen
ECCC
2010
122views more  ECCC 2010»
13 years 5 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
OSDI
2004
ACM
14 years 7 months ago
Enhancing Server Availability and Security Through Failure-Oblivious Computing
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...