Raptor Codes and Cryptographic Issues
Information Theory
2008-11-07 v1 math.IT
Abstract
In this paper two cryptographic methods are introduced. In the first method the presence of a certain size subgroup of persons can be checked for an action to take place. For this we use fragments of Raptor codes delivered to the group members. In the other method a selection of a subset of objects can be made secret. Also, it can be proven afterwards, what the original selection was.
Cite
@article{arxiv.0811.0952,
title = {Raptor Codes and Cryptographic Issues},
author = {Mikko Malinen},
journal= {arXiv preprint arXiv:0811.0952},
year = {2008}
}
Comments
2 pages. Submitted to the IEEE Transactions on Information Theory