Raptor Codes and Cryptographic Issues

TL;DR

This paper introduces two cryptographic methods utilizing Raptor codes: one for subgroup presence verification and another for secret subset selection and verification.

Contribution

It presents novel cryptographic techniques based on Raptor codes for subgroup verification and secret subset identification.

Findings

Method enables subgroup presence check using Raptor code fragments.

Method allows secret subset selection with post-verification of original choice.

Demonstrates practical application of Raptor codes in cryptography.

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.