Schedule

Thursday Oct 26, 14:00: Léo on An Efficient and Parallel Gaussian Sampler for Lattices (Peikert 2010)
Friday Dec 3, 14:00 : Angelo on Efficient Lattice (H)IBE in the Standard Model (S. Agrawal, D. Boneh, and X. Boyen)

Recent references for Lattice-based Crypto

• Surveys:
  • Lattice-based Cryptography (Micciancio-Regev2008)
  • Lattice-based Cryptography (Regev2006)
  • Peikert's slides from TCC 2009
• Assumptions: On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem (LyubashevskyMicciancioCRYPTO2009). This clarifies the links between the main lattice problems used in design.
• Public-key encryption:
  • Lattice-based crypto based on LWE: On Lattices, Learning with Errors, Random Linear Codes, and Cryptography (RegevSTOC2005) . This is a must-read for IBE papers. Among others, it makes connections between LWE and lattice problems.
  • IND-CCA2 based on lattices: Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem (PeikertSTOC2009)
  • Efficient Public Key Encryption Based on Ideal Lattices (Stehlé et al., ASIACRYPT2009)
• IBE and hash-and-sign signatures
  • In the random-oracle model: Trapdoors for Hard Lattices and New Cryptographic Constructions (Gentry et al., STOC2008). Easy to read, and a must for lattice-based IBE.
  • Standard-model HIBE:
    • Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography) (Peikert2009)
    • How to Delegate a Lattice Basis (Cash et al., 2009)
• Tree-based signatures: Asymptotically efficient lattice-based digital signatures (LyubashevskyMicciancioTCC2008)
• Identification: Lattice-based identification schemes secure under active attacks (LyubashevskyPKC2008)
• Key generation:
  • Generating Shorter Bases for Hard Random Lattices (AlwenPeikertSTACS2009)
  • Generating Hard Instances of the Short Basis Problem (AjtaiICALP1999)
• PAKE:
  • Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices (KatzVaikuntanathanASIACRYPT2009)
• Fully-Homomorphic Encryption
  • Fully homomorphic encryption using ideal lattices (GentrySTOC2009). The article that is making lattice-based crypto even more trendy.
  • Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes (SmartVercauteren, Preprint)
  • Fully Homomorphic Encryption over the Integers (van Dijk et al., Preprint)

Composition actuelle du mini-groupe

• Damien V.
• David P.
• Léo D.
• Mehdi T.
• Michel A.
• Phong N.
• Angelo D.
• Vadim L.
• Oded R