Table of contents

  • This session has been presented September 28, 2018.

Description

  • Speaker

    Fabrice Mouhartem - ENS Lyon

Group encryption (GE) is the natural encryption analogue of group signatures in that it allows verifiably encrypting messages for some anonymous member of a group while providing evidence that the receiver is a properly certified group member. Should the need arise, an opening authority is capable of identifying the receiver of any ciphertext. As intro- duced by Kiayias, Tsiounis and Yung (Asiacrypt’07), GE is motivated by applications in the context of oblivious retriever storage systems, anony- mous third parties and hierarchical group signatures. This paper provides the first realization of group encryption under lattice assumptions. Our construction is proved secure in the standard model (assuming interac- tion in the proving phase) under the Learning-With-Errors (LWE) and Short-Integer-Solution (SIS) assumptions. As a crucial component of our system, we describe a new zero-knowledge argument system allowing to demonstrate that a given ciphertext is a valid encryption under some hid- den but certified public key, which incurs to prove quadratic statements about LWE relations. Specifically, our protocol allows arguing knowledge of witnesses consisting of X ∈ ℤ_q^{m×n}, s ∈ ℤ_q^n and a small-norm e ∈ ℤ^m which underlie a public vector b = X · s + e ∈ ℤ_q^m while simultaneously proving that the matrix X ∈ ℤ_q^{m×n} has been correctly certified. We believe our proof system to be useful in other applications involving zero-knowledge proofs in the lattice setting. lien: rien

Next sessions

  • Adelic reduction of module lattices

    • November 13, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Henry Bambury - DGA-MI et Inria Rennes

    We give a strict generalisation of the LLL algorithm over number fields, based on the reduction theory of  $GL(n)$ over the adele ring of a number field. Our algorithm is free of heuristics, with rigorous bounds on output quality and complexity.   -- based on joint work with Seungki Kim, Changmin Lee and Phong Nguyen --
    • Cryptography

  • European Cyber Week: atelier cryptographie post-quantique

    • From November 18, 2026 to November 19, 2026 (09:00 - 18:00)

    • Couvent des jacobins, Rennes

    Dans la continuité des éditions 2021, 2022 et 2024, la DGA — en partenariat avec CREACH LABS et avec le soutien de l'ANSSI, de l'IRISA, de l'IRMAR et du Pôle d'Excellence Cyber — organise la 4e édition de l'atelier consacré à la cryptographie post-quantique dans le cadre de l'European Cyber Week 2026. Attention, il faut s'inscrire (gratuitement) au préalable — s'inscrire à la conférence Les[…]
  • Post-quantum day of the cryptography seminar

    • November 20, 2026 (09:00 - 15:00)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    A scientific day devoted to post-quantum cryptography, held in the wake of the European Cyber Week, with talks more technical than those presented at the ECW.
Show previous sessions