GREYC

Displaying 1-4 of 4 results

  • White Papers // Dec 2012

    Re-Encoding Reformulation and Application to Welch-Berlekamp Algorithm

    The main decoding algorithms for Reed-Solomon codes are based on a bivariate interpolation step, which is expensive in time complexity. Lot of interpolation methods were proposed in order to decrease the complexity of this procedure but stay expensive. Then Koetter, Ma and Vardy proposed in 2010 a technique, called re-encoding,...

    Provided By GREYC

  • White Papers // Jul 2010

    Privacy-Preserving RFID Systems: Model and Constructions

    In this paper, the authors study systems where a reader wants to authenticate and identify legitimate RFID tags. Such system needs thus to be correct (Legitimate tags are accepted) and sound (Fake tags are rejected). Moreover, an RFID tag in a privacy-preserving system should be anonymous and untraceable, except for...

    Provided By GREYC

  • White Papers // Jun 2008

    Two Generic Constructions of Probabilistic Cryptosystems and their Applications

    In this paper, the authors build, in a generic way, two asymmetric cryptosystems with a careful study of their security. They present first an additively homomorphic scheme which generalizes, among others, the paillier cryptosystem, and then, another scheme, built from a deterministic trapdoor function. Both schemes are proved semantically secure...

    Provided By GREYC

  • White Papers // Apr 2008

    Lattice-Based Homomorphic Encryption of Vector Spaces

    In this paper the authors presented a new lattice based homomorphic scheme faster than previously known schemes based on number theory, which moreover has the specificity to preserve vectorial structure. A natural question for which a complete treatment is beyond the scope of this paper is whether it is possible...

    Provided By GREYC

  • White Papers // Dec 2012

    Re-Encoding Reformulation and Application to Welch-Berlekamp Algorithm

    The main decoding algorithms for Reed-Solomon codes are based on a bivariate interpolation step, which is expensive in time complexity. Lot of interpolation methods were proposed in order to decrease the complexity of this procedure but stay expensive. Then Koetter, Ma and Vardy proposed in 2010 a technique, called re-encoding,...

    Provided By GREYC

  • White Papers // Jul 2010

    Privacy-Preserving RFID Systems: Model and Constructions

    In this paper, the authors study systems where a reader wants to authenticate and identify legitimate RFID tags. Such system needs thus to be correct (Legitimate tags are accepted) and sound (Fake tags are rejected). Moreover, an RFID tag in a privacy-preserving system should be anonymous and untraceable, except for...

    Provided By GREYC

  • White Papers // Apr 2008

    Lattice-Based Homomorphic Encryption of Vector Spaces

    In this paper the authors presented a new lattice based homomorphic scheme faster than previously known schemes based on number theory, which moreover has the specificity to preserve vectorial structure. A natural question for which a complete treatment is beyond the scope of this paper is whether it is possible...

    Provided By GREYC

  • White Papers // Jun 2008

    Two Generic Constructions of Probabilistic Cryptosystems and their Applications

    In this paper, the authors build, in a generic way, two asymmetric cryptosystems with a careful study of their security. They present first an additively homomorphic scheme which generalizes, among others, the paillier cryptosystem, and then, another scheme, built from a deterministic trapdoor function. Both schemes are proved semantically secure...

    Provided By GREYC