Raptor Codes and Cryptographic Issues

Simple item page
dc.creatorMalinen, Mikko
dc.date2008-11-06
dc.date.accessioned2026-07-07T10:16:24Z
dc.date.available2026-07-07T10:16:24Z
dc.descriptionIn 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.
dc.description2 pages. Submitted to the IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/0811.0952
dc.identifierhttp://arxiv.org/abs/0811.0952
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173496
dc.subjectInformation Theory
dc.titleRaptor Codes and Cryptographic Issues
dc.typetext

Files

Collections

arXiv