Sciweavers

2601 search results - page 457 / 521
» Secure Rewarding Schemes
Sort
View
IACR
2011
133views more  IACR 2011»
13 years 11 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti
EUROCRYPT
2012
Springer
13 years 2 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
ICIP
2007
IEEE
16 years 1 months ago
Lossless Image Compression and Selective Encryption using a Discrete Radon Transform
In this paper we propose a new joint encryption and lossless compression technique designed for large images 1 . The proposed technique takes advantage of the Mojette transform pr...
Andrew Kingston, Simone Colosimo, Patrizio Campisi...
PERCOM
2008
ACM
15 years 11 months ago
Towards Robust Low Cost Authentication for Pervasive Devices
Low cost devices such as RFIDs, sensor network nodes, and smartcards are crucial for building the next generation pervasive and ubiquitous networks. The inherent power and footpri...
Erdinç Öztürk, Ghaith Hammouri, B...
ACISICIS
2008
IEEE
15 years 6 months ago
SIMPA: A SIP-Based Mobile Payment Architecture
In recent years, many Mobile Payment (MP) schemes have been proposed and used in practise. However, a prerequisite for extended acceptance and adoption of MP technologies is to de...
Ge Zhang, Feng Cheng 0002, Christoph Meinel