Sciweavers

224 search results - page 5 / 45
» Secure Computation from Random Error Correcting Codes
Sort
View
SPAA
2003
ACM
13 years 11 months ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...
STACS
2009
Springer
14 years 1 months ago
Error-Correcting Data Structures
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
Ronald de Wolf
ICIP
2008
IEEE
14 years 8 months ago
Estimation of optimum coding redundancy and frequency domain analysis of attacks for YASS - a randomized block based hiding sche
Our recently introduced JPEG steganographic method called Yet Another Steganographic Scheme (YASS) can resist blind steganalysis by embedding data in the discrete cosine transform...
Anindya Sarkar, Lakshmanan Nataraj, B. S. Manjunat...
ICC
2007
IEEE
125views Communications» more  ICC 2007»
14 years 27 days ago
On Bit Error Robustness of Trellis Source Codes
— Trellis codes based on linear congruential recursions have recently been introduced as powerful source codes. For a modest computational complexity they offer excellent rate di...
Tomas Eriksson, Norbert Goertz
SACRYPT
2009
Springer
212views Cryptology» more  SACRYPT 2009»
14 years 1 months ago
Compact McEliece Keys from Goppa Codes
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...
Rafael Misoczki, Paulo S. L. M. Barreto